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

This note presents new results for the squarefree value sets of quartic polynomials over the integers.

We study few properties of square-free integers in certain equations. Using this property, we derive some infinite products in powers of square free numbers. Also, we present a method, to convert power series and trigonometric series to…

Let f be a cubic polynomial. Then there are infinitely many primes p such that f(p) is square-free.

Let $n$ be a squarefree positive odd integer. We will show that there exist infinitely many imaginary quadratic number fields with discriminant divisible by $n$ and-at the same time-having an element of order $n$ in the class group. We then…

Finite alphabets of at least three letters permit the construction of square-free words of infinite length. We show that the entropy density is strictly positive and derive reasonable lower and upper bounds. Finally, we present an…

In a recent paper, one of us posed three open problems concerning squarefree arithmetic progressions in infinite words. In this note we solve these problems and prove some additional results.

Let $u \shuffle v$ denote the set of all shuffles of the words $u$ and $v$. It is shown that for each integer $n \geq 3$ there exists a square-free ternary word $u$ of length $n$ such that $u\shuffle u$ contains a square-free word. This…

Let $[\, \cdot\,]$ be the floor function. In this paper we show that when $1<c<\frac{3849}{3334}$, then there exist infinitely many prime numbers of the form $[n^c]$, where $n$ is square-free.

Let f\in Z[x], deg(f)=3. Assume that f does not have repeated roots. Assume as well that, for every prime q, the inequality f(x)\not\equiv 0 mod q^2 has at least one solution in (Z/q^2 Z)^*. Then, under these two necessary conditions, there…

We prove new results related to the digital reverse $\overleftarrow{n}$ of a positive integer $n$ in a fixed base $b$. First we show that for $b\geq 26000$, there exists infinitely many primes $p$ such that $\overleftarrow{p}$ is…

An efficient, when compared to exhaustive enumeration, algorithm for computing the number of square-free words of length $n$ over the alphabet $\{a, b, c\}$ is presented.

We prove that there are infinitely many integers, which can represent as sum of a square-free integer and a prime $p$ with $||\alpha p+\beta||<p^{-1/10}$, where $\alpha$ is irrational.

We give asymptotics for correlation sums linked with the distribution of squarefree numbers in arithmetic progressions over a fixed modulus. As a particular case we improve a result of Blomer concerning the variance.

We prove that every integer greater than two may be written as the sum of a prime and a square-free number.

A recent heuristic argument based on basic concepts in spectral analysis showed that the twin prime conjecture and a few other related primes counting problems are valid. A rigorous version of the spectral method, and a proof for the…

We prove the remaining case of a conjecture of Borwein and Choi concerning an estimate on the square of the number of solutions to n=x^2+Ny^2 for a squarefree integer N.

We obtain an asymptotic formula for the number of ways to represent every reduced residue class as a product of a prime and square-free integer. This may be considered as a relaxed version of a conjecture of Erd\"os, Odlyzko, and…

In this article, we study necessary conditions for certain square-free integers to be congruent numbers. Our method uses divisibility properties of class numbers of related imaginary quadratic fields. We first consider positive square-free…

In 1987, Dan Gordon defined an elliptic curve analogue to Carmichael numbers known as elliptic Carmichael numbers. In this paper, we prove that there are infinitely many elliptic Carmichael numbers. In doing so, we resolve in the…

We present an asymptotic formula for the number of line segments connecting q+1 points of an nxn square grid, and a sharper formula, assuming the Riemann hypothesis. We also present asymptotic formulas for the number of lines through at…