English
Related papers

Related papers: On Mullin's second sequence of primes

200 papers

We give a more strong heuristic justification of our conjecture on the excess of the odious primes.

Number Theory · Mathematics 2011-11-10 Vladimir Shevelev

Let $n\in\mathbb{Z}^+$. Is it true that every sequence of $n$ consecutive integers greater than $n^2$ and smaller than $(n+1)^2$ contains at least one prime number? In this paper we show that this is actually the case for every $n \leq…

Number Theory · Mathematics 2014-04-04 Germán Paz

The aim of this note is a proof of a recent conjecture of Kellner concerning the number of distinct prime factors of a particular product of primes. The proof uses profound results from analytic number theory, such as Granville-Ramar\'{e}'s…

Number Theory · Mathematics 2017-05-30 Olivier Bordellès

Goldbach`s Conjecture, "every even number greater than 2 can be expressed as the sum of two primes" is renamed Goldbach`s Rule for it can not be otherwise. The conjecture is proven by showing that the existence of prime pairs adding to any…

General Mathematics · Mathematics 2007-05-23 Metin Aktay

Euler showed that if an odd perfect number $N$ exists, it must consist of two parts $N=q^k n^2$, with $q$ prime, $q \equiv k \equiv 1 \pmod{4}$, and gcd$(q,n)=1$. Dris conjectured that $q^k < n$. We first show that $q<n$ for all odd perfect…

Number Theory · Mathematics 2016-02-05 Patrick Brown

In this paper we consider the inductive Alperin-McKay condition for quasi-isolated 2-blocks of exceptional groups of Lie type. Thereby, we complete the proof of the Alperin-McKay conjecture for the prime 2.

Representation Theory · Mathematics 2022-04-14 Lucas Ruhstorfer

We speculate on the distribution of primes in exponentially growing, linear recurrence sequences $(u_n)_{n\geq 0}$ in the integers. By tweaking a heuristic which is successfully used to predict the number of prime values of polynomials, we…

Number Theory · Mathematics 2024-09-10 Jon Grantham , Andrew Granville

We establish the existence of infinitely many \emph{polynomial} progressions in the primes; more precisely, given any integer-valued polynomials $P_1, >..., P_k \in \Z[\m]$ in one unknown $\m$ with $P_1(0) = ... = P_k(0) = 0$ and any $\eps…

Number Theory · Mathematics 2013-03-01 Terence Tao , Tamar Ziegler

This note highlights an interesting connection between Euler sums of even weight and prime numbers.

General Mathematics · Mathematics 2008-03-14 Donal F. Connon

We show that the difference between consecutive terms in sequences of integers whose greatest prime factor grows slowly tends to infinity.

Number Theory · Mathematics 2023-08-07 C. L. Stewart

We prove that every sufficiently large integer $n$ can be written as the sum of a prime and an integer that is not square-free. In addition, we expect this result holds for every $n > 24$ and prove two results to support this claim. First,…

Number Theory · Mathematics 2026-05-05 Ethan S. Lee , Rowan O'Clarey

In this article we prove that equation $\phi(x)=n$, for a fixed $n$, admits a finite number of solutions, we find the general form of these solutions, and we show that: if $x_0$ is a unique solution of this equation then $x_0$ is a product…

General Mathematics · Mathematics 2007-05-23 Florentin Smarandache

We determine a necessary and sufficient condition for the infinitude of primes $p$ such that none of the equations $a_i^x \equiv b_i \pmod{p}, 1 \le i \le n,$ are solvable. We control the insolvability of $a^x \equiv b \pmod{p}$ by power…

Number Theory · Mathematics 2020-07-03 Olli Järviniemi

For a class of Lucas sequences ${x_n}$, we show that if $n$ is a positive integer then $x_n$ has a primitive prime factor which divides $x_n$ to an odd power, except perhaps when $n = 1, 2, 3 or 6$. This has several desirable consequences.

Number Theory · Mathematics 2013-01-01 Andrew Granville

A conjecture of Mordell states that if $p$ is a prime and $p$ is congruent to $3$ mod $4$, then $p$ does not divide $y$ where $(x,y)$ is the fundamental solution to $x^{2}-py^{2}=1$. The conjecture has been verified for primes not exceeding…

Number Theory · Mathematics 2019-06-28 Debopam Chakraborty , Anupam Saikia

The problem of finding perfect Euler cuboids or proving their non-existence is an old unsolved problem in mathematics. The second cuboid conjecture is one of the three propositions suggested as intermediate stages in proving the…

Number Theory · Mathematics 2012-01-06 Ruslan Sharipov

In this paper, if prime $p\equiv 3\pmod 4$ is sufficiently large then we prove an upper bound on the number of occurences of any arbitrary pattern of quadratic residues and nonresidues of length $k$ as $k$ tends to $\lceil \log_2 p\rceil$.…

Number Theory · Mathematics 2022-01-25 Shivarajkumar

We present a self-contained elementary and detailed exposition of Mertens' own proof of his theorem on the divergence of the series of the reciprocals of the primes and compare it with the modern proofs. His proof contains explicit…

History and Overview · Mathematics 2007-05-23 Mark B. Villarino

The set of short intervals between consecutive primes squared has the pleasant---but seemingly unexploited---property that each interval $s_k:=\{p_k^2, \dots,p_{k+1}^2-1\}$ is fully sieved by the $k$ first primes. Here we take advantage of…

Number Theory · Mathematics 2014-08-13 Kolbjørn Tunstrøm

Elkies proved the infinitude of supersingular primes for elliptic curves over real number fields. We generalize Elkies' result to some abelian fourfolds in Mumford's families, and more generally, to certain families of Kuga-Satake abelian…

Number Theory · Mathematics 2025-11-11 Fangu Chen