Related papers: On prime values of binary quadratic forms with a t…
We prove an asymptotic formula for primes of the shape $f(a,b^2)$ with $a,b$ integers and of the shape $f(a,p^2)$ with $p$ prime. Here $f$ is a binary quadratic form with integer coefficients, irreducible over $\mathbb{Q}$ and has no local…
This paper examines with elementary proofs some interesting properties of numbers in the binary quadratic form $a^2+ab+b^2$, where $a$ and $b$ are non-negative integers. Key findings of this paper are (i) a prime number $p$ can be…
In this paper, we prove that there are infinitely many primes of the form $\ell^2 - \ell m + m^2$ such that $2\ell - m$ is also prime. To prove this, we follow along the lines of the work of Fouvry and Iwaniec (1997) who showed that there…
Let A be a finite set of integers. For a polynomial f(x_1,...,x_n) with integer coefficients, let f(A) = {f(a_1,...,a_n) : a_1,...,a_n \in A}. In this paper it is proved that for every pair of normalized binary linear forms f(x,y)=u_1x+v_1y…
Given a binary quadratic form $F \in \mathbb{Z}[X, Y]$, we define its value set $F(\mathbb{Z}^2)$ to be $\{F(x, y) : (x, y) \in \mathbb{Z}^2\}$. If $F$ and $G$ are two binary quadratic forms with integer coefficients, we give necessary and…
Let $f(x,y)=ax^2+bxy+cy^2$ be a binary quadratic form with integer coefficients. For a prime $p$ not dividing the discriminant of $f$, we say $f$ is completely $p$-primitive if for any non-zero integer $N$, the diophantine equation…
Given a negative $D>-(\log X)^{\log 2-\delta}$, we give a new upper bound on the number of square free integers $<X$ which are represented by some but not all forms of the genus of a primitive positive definite binary quadratic form $f$ of…
For a positive integer $m$, a (positive definite integral) quadratic form is called primitively $m$-universal if it primitively represents all quadratic forms of rank $m$. It was proved in arXiv:2202.13573 that there are exactly $107$…
We prove several results about integers represented by positive definite quadratic forms, using a Fourier analysis approach. In particular, for an integer $\ell\geq 1$, we improve the error term in the partial sums of the number of…
A (positive definite and integral) quadratic form $f$ is said to be $\textit{universal}$ if it represents all positive integers, and is said to be $\textit{primitively universal}$ if it represents all positive integers primitively. We also…
This note investigates the prime values of the polynomial $f(t)=qt^2+a$ for any fixed pair of relatively prime integers $ a\geq 1$ and $ q\geq 1$ of opposite parity. For a large number $x\geq1$, an asymptotic result of the form $\sum_{n\leq…
In his paper Almost-Primes Represented by Quadratic Polynomials, Iwaniec proved that the polynomial n^2 + 1 takes on values with at most two prime factors (counted with multiplicity) infinitely often. He states that "in order to avoid…
A positive definite integral quadratic form is said to be almost (primitively) universal if it (primitively) represents all but at most finitely many positive integers. In general, almost primitive universality is a stronger property than…
By establishing an improved level of distribution we study almost primes of the form $f(p,n)$ where $f$ is an irreducible binary form over $\mathbb Z$.
A positive quadratic form is $(k,\ell)$-universal if it represents all the numbers $kx+\ell$ where $x$ is a non-negative integer, and almost $(k,\ell)$-universal if it represents all but finitely many of them. We prove that for any $k,\ell$…
Representations of primes by simple quadratic forms, such as $\pm a^2\pm qb^2$, is a subject that goes back to Fermat, Lagrange, Legendre, Euler, Gauss and many others. We are interested in a comprehensive list of such results, for $q\le…
Jagy and Kaplansky exhibited a table of 68 pairs of positive definite binary quadratic forms that represent the same odd primes and conjectured that this list is complete outside of "trivial" pairs. In this article, we find all pairs of…
Let $\mathcal{A}'$ be the set of integers missing any three fixed digits from their decimal expansion. We produce primes in a thin sequence by proving an asymptotic formula for counting primes of the form $p = m^2 + \ell^2$, with $\ell \in…
In this note, we give an elementary proof of the following classical fact. Any positive definite ternary quadratic form over the rational numbers fails to represent infinitely many positive integers. For any ternary quadratic form (positive…
We show that there are infinitely many primes of the form $X^2+(Y^2+1)^2$ and $X^2+(Y^3+Z^3)^2$. This extends the work of Friedlander and Iwaniec showing that there are infinitely many primes of the form $X^2+Y^4$. More precisely,…