Related papers: Square-free values of $\mathbf{n^2+n+1}$

In this paper, we develop a method of evaluating general exponential sums with rational amplitude functions for multiple variables which complements works by T. Cochrane and Z. Zheng on the single variable case. As an application, for…

We determine all integers $n$ such that $n^2$ has at most three base-$q$ digits for $q \in \{2, 3, 4, 5, 8, 16 \}$. More generally, we show that all solutions to equations of the shape $$ Y^2 = t^2 + M \cdot q^m + N \cdot q^n, $$ where $q$…

We study a function field version of a classical problem concerning square-free values of polynomials evaluated at primes. We show that for a square-free polynomial $f\in \mathbb{F}_q[t][x]$, there is a limiting density as $n\to \infty$ of…

We show that for a fixed integer $n \neq \pm2$, the congruence $x^2 + nx \pm 1 \equiv 0 \pmod{\alpha}$ has the solution $\beta$ with $0 < \beta < \alpha$ if and only if $\alpha/\beta$ has a continued fraction expansion with sequence of…

For an integer n, a set of m distinct nonzero integers {a_1,a_2,...,a_m} such that a_i a_j+n is a perfect square for all 0<i<j<m+1, is called a D(n)-m-tuple. In this paper, we show that there are infinitely many essentially different…

We wish to discuss positive integer solutions to the Diophantine equation $$\prod_{k=1}^n(k^2+1)=b^2.$$ Some methods in analytic number theory will be used to tackle this problem.

We solve unconditionally the class number one problem for the $2$-parameter family of real quadratic fields $\mathbb{Q}(\sqrt{d})$ with square-free discriminant $d=(an)^2+4a$ for positive odd integers $a$ and $n$.

It is classically known that the circle method produces an asymptotic for the number of representations of a tuple of integers $(n_1,\ldots,n_R)$ by a system of quadratic forms $Q_1,\ldots, Q_R$ in $k$ variables, as long as $k$ is…

We search for triangular numbers that are multiples of other triangular numbers. It is found that for any positive non-square integer multiplier, there is an infinity of multiples of triangular numbers that are triangular numbers and…

Let $x$ denote a sufficiently large integer. We show that the recent result of Grimmelt and Merikoski actually yields the largest prime factor of $n^2 +1$ is greater than $x^{1.317}$ infinitely often. As an application, we give a new upper…

We find an asymptotic formula for the number of pairs of positive integers $x_1, x_2 \le H$ such that the product $x_1 x_2$ is a $k$-th power.

We consider the problem of enumerating the number of irreducible transformation shift registers. We give an asymptotic formula for the number of irreducible transformation shift registers in some special cases. Moreover, we derive a short…

A word is square-free if it does not contain a nonempty word of the form $XX$ as a factor. A famous 1906 result of Thue asserts that there exist arbitrarily long square-free words over a $3$-letter alphabet. We study square-free words with…

The goal is to obtain an asymptotic formula for the number of quadratic extensions with bounded discriminant of a some quadratic number field with odd class number. This extends an already known result for Q.

For a fixed abelian group $H$, let $N_H(X)$ be the number of square-free positive integers $d\leq X$ such that H is a subgroup of $CL(\mathbb{Q}(\sqrt{-d}))$. We obtain asymptotic lower bounds for $N_H(X)$ as $X\to\infty$ in two cases:…

Consider the polynomial $f(x,y)=xy^k+C$ for $k\geq 2$ and any nonzero integer constant $C$. We derive an asymptotic formula for the $k$-free values of $f(x,y)$ when $x, y\leq H$. We also prove a similar result for the $k$-free values of…

We prove that paramodular newforms of odd square-free level have infinitely many non-zero fundamental Fourier coefficients.

We establish that almost every positive integer $n$ is the sum of four cubes, two of which are at most $n^{\theta}$, as long as $\theta\geq192/869$. An asymptotic formula for the number of such representations is established when…

We identify a recursive structure among factorizations of polynomial values into two integer factors. Polynomials for which this recursive structure characterizes all non-trivial representations of integer factorizations of the polynomial…

We give a formula and an estimation for the number of irreducible polynomials in two (or more) variables over a finite field.