相关论文: An elementary proof of uniqueness of Markoff numbe…
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…
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…
In this paper, we study positive integer solutions to a generalized form of the Markov equation, given as $x^2 + y^2 + z^2 + k(yz + zx + xy) = (3 + 3k)xyz$. This equation extends the classical Markov equation $x^2 + y^2 + z^2 = 3xyz$. We…
Markov's theorem classifies the worst irrational numbers with respect to rational approximation and the indefinite binary quadratic forms whose values for integer arguments stay farthest away from zero. The main purpose of this paper is to…
We present a new topological proof of the infinitude of prime numbers with a new topology. Furthermore, in this topology, we characterize the infinitude of any non-empty subset of prime numbers.
In this note we generalise a method of Perott to give new proofs that there are infinitely many prime numbers.
Assuming the obvious definitions (see paper) we show the a decidable model that is effectively prime is also effectively atomic. This implies that two effectively prime (decidable) models are computably isomorphic. This is in contrast to…
We prove results pertaining to strong approximation for Markoff triples in the case of prime moduli.
We present a new, elementary, dynamical proof of the prime number theorem.
In this short paper we present an elementary proof of the infinitude of primes. Our proof is similar in spirit to Euler's proof that the reciprocals of primes diverges and only uses tools from elementary number theory and calculus. In…
The set of prime numbers has been analyzed, based on their algebraic and arithmetical structure. Here by obtaining a sort of linear formula for the set of prime numbers, they are redefined and identified; under a systematic procedure it has…
We establish pointwise ergodic theorems for a large class of natural averages on simple Lie groups of real-rank-one, going well beyond the radial case considered previously. The proof is based on a new approach to pointwise ergodic…
This note concerns the non-existence of three consecutive powerful numbers. We use Pell equations, elliptic curves, and second-order recurrences to show that there are no such triplets with the middle term a perfect cube and each of the…
We present an extremely elementary construction of the simple Lie algebras over the complex numbers in all of their minuscule representations, using the vertices of various polytopes. The construction itself requires no complicated…
Let $a_0\in\{0,\dots,9\}$. We show there are infinitely many prime numbers which do not have the digit $a_0$ in their decimal expansion. The proof is an application of the Hardy-Littlewood circle method to a binary problem, and rests on…
We give a short proof -- not relying on ideal classes or the geometry of numbers -- of a known criterion for quadratic orders to possess unique factorization.
In this paper we introduce generalised Markov numbers and extend the classical Markov theory for the discrete Markov spectrum to the case of generalised Markov numbers. In particular we show recursive properties for these numbers and find…
Associate a unique numerical sequence called the modular signature with each positive integer, using modular residues of each integer under the prime numbers, and distinguishing between the core seed primes and non-core seed primes used to…
Kronecker observed that either all roots or only one root of a solvable irreducible equation of odd prime degree with integer coefficients are real. This gives a possibility to construct specific examples of equations not solvable by…
We give a new sufficient condition which allows to test primality of Fermat's numbers. This characterization uses uniquely values at most equal to tested Fermat number. The robustness of this result is due to a strict use of elementary…