We give a simple and independent proof of the result of Jack Button and Paul Schmutz that the Markoff conjecture on the uniqueness of the Markoff triples (a,b,c), where a, b, and c are in increasing order, holds whenever $c$ is a prime power.
We present a very elementary proof of the uniqueness of Markoff numbers which are prime powers or twice prime powers, in the sense that it uses neither algebraic number theory nor hyperbolic geometry.
By making use of only simple facts about congruence, we first show that every even Markoff number is congruent to 2 modulo 32, and then, generalizing an earlier result of Baragar, establish the uniqueness for those Markoff numbers c where one of 3c - 2 and 3c + 2 is a prime power, 4 times a prime power, or 8 times a prime power.
The Markoff group of transformations is a group $Γ$ of affine integral morphisms, which is known to act transitively on the set of all positive integer solutions to the equation $x^{2}+y^{2}+z^{2}=xyz$. The fundamental strong approximation conjecture for the Markoff equation states that for every prime $p$, the group $Γ$ acts transitively on the set $X^{*}\left(p\right)$ of non-zero solutions to the same equation over $\mathbb{Z}/p\mathbb{Z}$. Recently, Bourgain, Gamburd and Sarnak proved this conjecture for all primes outside a small exceptional set. In the current paper, we study a group of …
We confirm, for the primes up to 3000, the conjecture of Bourgain, Gamburd, and Sarnak on strong approximation for the Markoff surface $x^2+y^2+z^2 = 3xyz$ modulo primes. For primes congruent to 3 modulo 4, we find data suggesting that some natural graphs constructed from this equation are asymptotically Ramanujan. For primes congruent to 1 modulo 4, the data suggest a weaker spectral gap. In both cases, there is close agreement with the Kesten-McKay law for the density of states for random 3-regular graphs. We also study the connectedness of other level sets $x^2+y^2+z^2-3xyz = k$. In the deg…
We prove the non-planarity of a family of 3-regular graphs constructed from the solutions to the Markoff equation $x^2+y^2+z^2=xyz$ modulo prime numbers greater than 7. The proof uses Euler characteristic and an enumeration of the short cycles in these graphs. Non-planarity for large primes would follow assuming a spectral gap, which was the original motivation. For primes congruent to 1 modulo 4, or congruent to 1, 2, or 4 modulo 7, explicit constructions give an alternate proof of non-planarity.
For each prime $p$, we study the eigenvalues of a 3-regular graph on roughly $p^2$ vertices constructed from the Markoff surface. We show they asymptotically follow the Kesten-McKay law, which also describes the eigenvalues of a random regular graph. The proof is based on the method of moments and takes advantage of a natural group action on the Markoff surface.
The Markoff injectivity conjecture states that $w\mapstoμ(w)_{12}$ is injective on the set of Christoffel words where $μ:\{\mathtt{0},\mathtt{1}\}^*\to\mathrm{SL}_2(\mathbb{Z})$ is a certain homomorphism and $M_{12}$ is the entry above the diagonal of a $2\times2$ matrix $M$. Recently, Leclere and Morier-Genoud (2021) proposed a $q$-analog $μ_q$ of $μ$ such that $μ_{q}(w)_{12}|_{q=1}=μ(w)_{12}$ is the Markoff number associated to the Christoffel word $w$ when evaluated at $q=1$. We show that there exists an order $<_{radix}$ on $\{\mathtt{0},\mathtt{1}\}^*$ such that for every balanced sequenc…
We begin an investigation of the action of pseudo-Anosov elements of $\mathrm{Out}(\mathbf{F}_{2})$ on the Markoff-type varieties \[ \mathbb{X}_κ:\:x^{2}+y^{2}+z^{2}=xyz+2+κ\] over finite fields $\mathbb{F}_{p}$ with $p$ prime. We first make a precise conjecture about the permutation group generated by $\mathrm{Out}(\mathbf{F}_{2})$ on $\mathbb{X}_{-2}(\mathbb{F}_{p})$ that shows there is no obstruction at the level of the permutation group to a pseudo-Anosov acting `generically'. We prove that this conjecture is sharp. We show that for a fixed pseudo-Anosov $g\in\mathrm{Out}(\mathbf{F}_{2})$,…
As a consequence of the classification of finite simple groups, the classification of permutation groups of prime degree is complete, apart from the question of when the natural degree $(q^n-1)/(q-1)$ of ${\rm PSL}_n(q)$ is prime. We present heuristic arguments and computational evidence based on the Bateman-Horn Conjecture to support a conjecture that for each prime $n\ge 3$ there are infinitely many primes of this form, even if one restricts to prime values of $q$. Similar arguments and results apply to the parameters of the simple groups ${\rm PSL}_n(q)$, ${\rm PSU}_n(q)$ and ${\rm PSp}_{2n…
In the present work we prove a number of surprising results about gaps between consecutive primes and arithmetic progressions in the sequence of generalized twin primes which could not have been proven without the recent fantastic achievement of Yitang Zhang about the existence of bounded gaps between consecutive primes. Most of these results would have belonged to the category of science fiction a decade ago. However, the presented results are far from being immediate consequences of Zhang's famous theorem: they require various new ideas, other important properties of the applied sieve functi…
If $p_k$ is the k-th prime, the Firoozbakht conjecture states that the sequence $(p_k)^{1/k}$ is strictly decreasing. We use the table of first-occurrence prime gaps in combination with known bounds for the prime-counting function to verify the Firoozbakht conjecture for primes up to four quintillion $(4\times10^{18})$.
A conjecture of Cai-Zhang-Shen for figurate primes says that every integer $k>1$ is the sum of two figurate primes. In this paper we give an equivalent proposition to the conjecture. By considering extreme value problems with constraints about the conjecture in the cases of odd and even integers and using the method of Lagrange multipliers, Cardano formula for cubic equations and the contradiction, we prove the conjecture.
In this paper, we prove the Iwasawa main conjecture for elliptic curves at an odd supersingular prime p. Some consequences are the p-parts of the leading term formulas in the Birch and Swinnerton-Dyer conjectures for analytic rank 0 or 1.
Let $\mathcal{P}$ be the set of all primes and $π(x)$ be the number of primes up to $x$. For any $n\ge 2$, let $P^+(n)$ be the largest prime factor of $n$. For $0<c<1$, let $$T_c(x)=\#\{p\le x:p\in \mathcal{P},P^+(p-1)\ge p^c\}.$$ In this note, we proved that there exists some $c<1$ such that $$\limsup_{x\rightarrow\infty}\frac{T_c(x)}{π(x)}<\frac12,$$ which disproves a conjecture of Chen and Chen.
In this paper, we make some conjectures on prime numbers that are sharper than those found in the current literature. First we describe our studies on Legendre's Conjecture which is still unsolved. Next, we show that Brocard's Conjecture can be proved assuming our improved version of Legendre's Conjecture. Finally, we sharpen the Bertrand's Postulate for prime numbers. Our results are backed by extensive empirical investigation.
Multiplicative arithmetic functions satisfying the parallelogram functional equation on prime numbers are investigated. It is derived that the unique solution is a quadratic function by the Goldbach's conjecture.
We present here a new conjecture for the nature of the Mersenne prime numbers by connecting it with the Collatz-Kakutani problem. By introducing a natural path length on the basis of the Collatz-Kakutani tree, we conjecture that this path length of a Mersenne prime from the root of the Collatz-Kakutani tree is approximately proportional to the index of the Mersenne prime. We also discuss difference of behaviors between Mersenne numbers and Mersenne primes.
In 1922 Hardy and Littlewood proposed a conjecture on the asymptotic density of admissible prime k-tuples. In 2011 Wolf computed the "Skewes number" for twin primes, i.e., the first prime at which a reversal of the Hardy-Littlewood inequality occurs. In this paper, we find "Skewes numbers" for 8 more prime k-tuples and provide numerical data in support of the Hardy-Littlewood conjecture. Moreover, we present several algorithms to compute such numbers.
Under Cramér's conjecture concerning the prime numbers, we prove that for any $x>1$, there exists a real $A=A(x)>1$ for which the formula $[A^{n^x}]$ (where $[]$ denotes the integer part) gives a prime number for any positive integer $n$. Under the same conjecture, we also prove that for any $ε>0$, there exists a positive real number $B$ for which the formula $[B.{n!}^{2+ε}]$ gives a prime number for any sufficiently large positive integer $n$.
In 1987, B. Perrin-Riou formulated a Heegner point main conjecture for elliptic curves at primes of ordinary reduction. In this paper, we formulate an analogue of Perrin-Riou's main conjecture for supersingular primes. We then prove this conjecture under mild hypotheses, and deduce from this result a $Λ$-adic extension of Kobayashi's $p$-adic Gross-Zagier formula, new cases of B.-D. Kim's doubly-signed main conjectures, and a strengthened version of Skinner's converse to the Gross-Zagier-Kolyvagin theorem for supersingular primes.
In this paper we present some observations about the well-known Goldbach conjecture. In particular we list and interpret some numerical results which allow us to formulate a relation between prime numbers and even integers. We can also determine very thin and low diverging ranges in which the probability of finding a prime is one.
In this paper, we prove a few lemmas concerning Fibonacci numbers modulo primes and provide a few statements that are equivalent to Wall-Sun-Sun Prime Conjecture. Further, we investigate the conjecture through heuristic arguments and propose a few additional conjectures for future research.
I present a new property of prime numbers that leads to a generalization of Cramer's conjecture. The study of the gap between consecutive primes is treated as a special case of the gap between consecutive terms of sequences having a certain property called pseudo equidistribution. Both rigorous as well as heuristic arguments are given in support of the generalized Cramer's conjectures.
We improve Bombieri's asymptotic sieve to localise the variables. As a consequence, we prove, under a Elliott-Halberstam conjecture, that there exists an infinity of twins almost prime. Those are prime numbers $p$ such that for all $\varepsilon>0$, $p-2$ is either a prime number or can be written as $p_1 p_2$ where $p_1$ and $p_2$ are prime and $p_1<X^{\varepsilon}$, and we give the explicit asymptotic.
We give an estimation of the existence density for the $2d$ different primes by using a new and simple algorithm for getting the $2d$ different primes. The algorithm is a kind of the sieve method, but the remainders are the central numbers between the $2d$ different primes. We may conclude that there exist infinitely many $2d$ different primes including the twin primes in case of $d=1$ because we can give the lower bounds of the existence density for the $2d$ different primes in this algorithm. We also discuss the Hardy-Littlewood conjecture and the Sophie Germain primes.
In this paper, by using the theory of elliptic curves, we discuss several Diophantine equations related with the so-called figurate primes. Meanwhile, we raise several conjectures related with figurate primes and Hilbert's 8th problem, including Goldbach's conjecture, twin primes conjecture and Catalan's conjecture as well.
We investigate progressions in the set of pairs of integers $\mathbb{Z}^2$ and define a generalisation of the Jacobsthal function. For this function, we conjecture a specific upper bound and prove that this bound would be a sufficient condition for the truth of the Goldbach conjecture, the infinitude of prime twins, and more general of prime pairs with a fixed even difference.
In this paper we establish a function field analogue of a conjecture in number theory which is a combination of several famous conjectures, including the Hardy-Littlewood prime tuple conjecture, conjectures on the number of primes in arithmetic progressions and in short intervals, and the Goldbach conjecture. We prove an asymptotic formula for the number of simultaneous prime values of $n$ linear functions, in the limit of a large finite field.
For every even integer N, denote by D_{1,2}(N) the number of representations of N as a sum of a prime and an integer having at most two prime factors. In this paper, we give a new lower bound for D_{1,2}(N).
We formulate some refinements of Goldbach's conjectures based on heuristic arguments and numerical data. For instance, any even number greater than 4 is conjectured to be a sum of two primes with one prime being 3 mod 4. In general, for fixed $m$ and $a, b$ coprime to $m$, any positive even $n \equiv a + b \bmod m$ outside of a finite exceptional set is expected to be a sum of two primes $p$ and $q$ with $p \equiv a \bmod m$, $q \equiv b \bmod m$. We make conjectures about the growth of these exceptional sets.
We study p-divisibility of discriminants of Hecke algebras associated to spaces of cusp forms of prime level. We make a precise conjecture about the indexes of Hecke algebras in their normalisation which implies (if true) the conjecture that there are no mod p congruences between non-conjugate newforms of weight 2 and level Gamma_0(p).
Let E be an elliptic curve over Q. In 1988, Koblitz conjectured a precise asymptotic for the number of primes p up to x such that the order of the group of points of E over the finite field F_p is prime. This is an analogue of the Hardy and Littlewood twin prime conjecture in the case of elliptic curves. Koblitz's conjecture is still widely open. In this paper we prove that Koblitz's conjecture is true on average over a two-parameter family of elliptic curves. One of the key ingredients in the proof is a short average distribution result in the style of Barban-Davenport-Halberstam, where the a…
Question 10208b (1992) of the American Mathematical Monthly asked: does there exist an increasing sequence $\{a_k\}$ of positive integers and a constant $B > 0$ having the property that $\{ a_k + n\}$ contains no more than $B$ primes for every integer $n$? A positive answer to this question became known as Golomb's conjecture. In this note we give a negative answer, making use of recent progress in prime number theory.
Jing Run Chen proved in 1966 that $p+2$ has at most two prime factors for infinitely many primes $p$. However, due to the parity problem we do not know whether $p+2$ has an odd (or even) number of prime factors infinitely often. In the present work it is proved that $p+d$ has an odd number of prime factors for at least one value of d=2,4,...16.
This paper demonstrates that from the Cramer's, Hardy-Littlewood's and Bateman-Horn's conjectures (suggest that the probability of a large positive integer being $x$ a prime - $\frac {1} {\ln(x)}$) it follows that the events consisting in a positive integer $x$ being not divisible by different primes are dependent with the ratio $0,5e^γ$ ($γ$ - Euler's constant). In establishing Hardy-Littlewood's and Bateman-Horn's conjectures, their authors followed the first suggestion by another one assuming the independence of the above-mentioned events, which on the basis of the first suggestion and Mert…
In this paper, we define $X$-base Fibonacci-Wieferich prime which is a generalized Wieferich prime where $X$ is a finite set of algebraic numbers. We are going to show that there are infinitely many non-$X$-base Fibonacci-Wieferich primes assuming the $abc$-conjecture of Masser-Oesterlé-Szpiro for number fields. We also provide a new conjecture concerning the rank of free part of abelian group generated by all elements in $X$, and we will use the arithmetic point of view and geometric point of view to give heuristic.
n this paper, we state several conjectures regarding distribution of primes and of pairs of primes represented by irreducible homogeneous polynomial in two variables $f(a,b)$. We formulate conjectures with respect to the slope $t=b/a$ for any irreducible polynomial $f$. Here, we formulate a conjecture for all irreducible polynomials. We also consider conjectures for distribution of pairs of primes. It show unexpected relation to multiple Dedekind zeta function - at $s=2$ for one prime and at $(s_1,s_2)=(2,2)$ for pairs of primes. We tested the conjecture for pairs of primes for several quadrat…
We suggest other models of sieve generated sequences like the Sieve of Eratosthenes to explain randomness properties of the prime numbers, like the twin prime conjecture, the lim sup conjecture, the Riemann conjecture, and the prime number theorem.
We prove the lower bound for the number of Lucas non-Wieferich primes in arithmetic progressions. More precisely, for any given integer $k\geq 2$ there are $\gg \log x$ Lucas non-Wieferich primes $p\leq x$ such that $p\equiv\pm1\pmod{k}$, assuming the $abc$ conjecture for number fields. Further, we discuss some applications of Lucas sequences in Cryptography.