Related papers: Squarefree smooth numbers and Euclidean prime gene…

We consider the representation of primes as a sum of a prime and twice a triangular number. We prove that a subset of the primes having density 1 is expressible in this form. We conjecture that every odd prime number is expressible as a sum…

We show that if 2^{aleph_0} Cohen reals are added to the universe, then for every reduced non-free torsion-free abelian group A of cardinality less than the continuum, there is a prime p so that Ext_p(A, Z) not= 0. In particular if it is…

If p is a prime, then the numbers 1, 2, ..., p-1 form a group under multiplication modulo p. A number g that generates this group is called a primitive root of p; i.e., g is such that every number between 1 and p-1 can be written as a power…

The unconditional, i.e. without assuming validity of RH, sharp limit relationship (as p tends to infinity) is found between the remainder in the modified Mertens asymptotic formula for the sums of primes' reciprocals and maximal values of…

We present a novel conjecture concerning the additive representation of natural numbers using prime powers. Based on extensive computational verification, we conjecture that every integer n > 23 can be expressed as a sum of at most five…

A $\textit{square-full}$ number is a positive integer for which all its prime divisors divide itself at least twice. The counting function of square-full integers of the form $f(n)$ for $n\leqslant N$ is denoted by…

In the present paper we show that there exist infinitely many consecutive square-free numbers of the form $[\alpha n]$, $[\alpha n]+1$, where $\alpha>1$ is irrational number with bounded partial quotient or irrational algebraic number.

Let $L_1$, $L_2$ $L_3$ be integer linear functions with no fixed prime divisor. We show there are infinitely many $n$ for which the product $L_1(n)L_2(n)L_3(n)$ has at most 7 prime factors, improving a result of Porter. We do this by means…

We consider a variant of a question of N. Koblitz. For an elliptic curve $E/\Q$ which is not $\Q$-isogenous to an elliptic curve with torsion, Koblitz has conjectured that there exists infinitely many primes $p$ such that…

We estimate the number of solutions of certain diagonal congruences involving factorials. We use these results to bound exponential sums with products of two factorials $n!m!$ and also derive asymptotic formulas for the number of solutions…

We prove an asymptotic formula for squarefree in arithmetic progressions with squarefree moduli, improving previous results by Prachar. The main tool is an estimate for counting solutions of a congruence inside a box that goes beyond what…

Let $p$ be a prime, $\varepsilon>0$ and $0<L+1<L+N < p$. We prove that if $p^{1/2+\varepsilon}< N <p^{1-\varepsilon}$, then $$ \#\{n!\!\!\! \pmod p;\,\, L+1\le n\le L+N\} > c (N\log N)^{1/2},\,\, c=c(\varepsilon)>0. $$ We use this bound to…

Let $\epsilon > 0$ be sufficiently small and let $0 < \eta < 1/522$. We show that if $X$ is large enough in terms of $\epsilon$ then for any squarefree integer $q \leq X^{196/261-\epsilon}$ that is $X^{\eta}$-smooth one can obtain an…

For coprime positive integers $a, b, c$, where $a+b=c$, $\gcd(a,b,c)=1$ and $1\leq a < b$, the famous $abc$ conjecture (Masser and Oesterl\`e, 1985) states that for $\varepsilon > 0$, only finitely many $abc$ triples satisfy $c >…

A method of constructing specific polynomial representations $f(x)$ over the finite field $\mathbb{F}_p$ of the square roots function modulo a prime $p = 2^kn + 1$, $n$ odd, is presented. The formulas for the cases $k = 2$, $3$ and $4$ are…

In this paper, we prove that every prime $p$ which is congruent to $4,7$ modulo $9$ is the sum of two rational cubes. This is $2/3$ of Sylvester's conjecture which has a history of nearly 150 years since 1879. In the proof, we use recent…

We provide examples of multiplicative functions $f$ supported on the squarefree integers, such that on primes $f(p)=\pm1$ and such that $M_f(x):=\sum_{n\leq x} f(n)=o(\sqrt{x})$. Further, by assuming the Riemann hypothesis (RH) we can go…

We study number theoretic properties of the map $x \mapsto x^{x} \mod{p}$, where $x \in \{1,2,\ldots,p-1\}$, and improve on some recent upper bounds, due to Kurlberg, Luca, and Shparlinski, on the number of primes $p < N$ for which the map…

In this paper, we prove a quantitative version of the statement that every nonempty finite subset of $\mathbb{N}^+$ is a set of quadratic residues for infinitely many primes of the form $[n^c]$ with $1\leqslant c\leqslant243/205$.…

Let p be a prime and a, c be integers such that a<>0 mod p. The quadratic generator is a sequence (u_n) of pseudorandom numbers defined by u_{n+1}=a*(u_n)^2+c mod p. In this article we probe that if we know sufficiently many of the most…