Related papers: Could Euler have conjectured the prime number theo…
We give a diagrammatic summary of the connections between various theorems and conjectures about the vanishing of the Euler characteristic.
In paper on a classification of Lehmer triples, Juricevic conjectured that there are infinitely many primes of special form. We disprove one of his conjectures and consider the other one.
The Collatz hypothesis is a theorem of the algorithmic theory of natural numbers. We prove the (algorithmic) formula that expresses the halting property of Collatz algorithm. The observation that Collatz's theorem cannot be proved in any…
This paper has two parts. The first part surveys Euler's work on the constant gamma=0.57721... bearing his name, together with some of his related work on the gamma function, values of the zeta function and divergent series. The second part…
In this expository article, we describe the recent approach, motivated by ergodic theory, towards detecting arithmetic patterns in the primes, and in particular establishing that the primes contain arbitrarily long arithmetic progressions.…
We prove some theorems which give sufficient conditions for the existence of prime numbers among the terms of a sequence which has pairwise relatively prime terms.
Let $K/\mathbb{Q}$ be an algebraic number field of class number one and $\mathcal{O}_K$ be its ring of integers. We show that there are infinitely many non-Wieferich primes with respect to certain units in $\mathcal{O}_K$ under the…
We recast Euclid's proof of the infinitude of prime numbers as a Euclidean Criterion for a domain to have infinitely many atoms. We make connections with Furstenberg's "topological" proof of the infinitude of prime numbers and show that our…
In the present work we demonstrate that the so called Goldbach conjecture from 1742, All positive even numbers greater than two can be expressed as a sum of two primes, due to Leonhard Euler, is a true statement. This result is partially…
In the proposed matrix primes, through which one can readily generate a sequence of primes. The paper also proposes a number of theorems proved by which an infinite number of prime numbers twins
We analyze selected iterated conditionals in the framework of conditional random quantities. We point out that it is instructive to examine Lewis's triviality result, which shows the conditions a conditional must satisfy for its probability…
A necessary and sufficient condition is provided for the solvability of a binomial congruence with a composite modulus, circumventing its prime factorization. This is a generalization of Euler's Criterion through that of Euler's Theorem,…
Hilbert's Irreducibility Theorem is a cornerstone that joins areas of analysis and number theory. Both the genesis and genius of its proof involved combining real analysis and combinatorics. We try to expose the motivations that led Hilbert…
G\"odel's argument for the First Incompleteness Theorem is, structurally, a proof by contradiction. This article intends to reframe the argument by, first, isolating an additional assumption the argument relies on, and then, second, arguing…
We point out that the recursive formula that appears in Erickson's presentation "Fusible Numbers" is incorrect, and pose an alternate conjecture about the structure of fusible numbers. Although we are unable to solve the conjecture, we…
In this article, we derive a congruence property of particular sum rules involving prime numbers. The resulting expression involves Bernoulli numbers and polynomials, for which we obtain, as a consequence, a general congruence relation as…
A long-standing, unanswered question regarding Euclid's Elements concerns the absence of a theorem for the concurrence of the altitudes of a triangle, and the possible reasons for this omission. In the centuries following Euclid, a…
Using Eulerian and Euler numbers, we establish congruences concerning sums involving harmonic numbers, tangent numbers and Genocchi numbers.
Euler's totient function counts the positive integers up to a given integer n that are relatively prime to n. The aim of this article is to give a result about the sum of euler's totient function from k equal 1 to n whene p divides n and p…
We present some new ideas on important problems related to primes. The topics of our discussion are: simple formulae for primes, twin primes, Sophie Germain primes, prime tuples less than or equal to a predefined number, and their…