Related papers: Could Euler have conjectured the prime number theo…

The $abc$ conjecture is a very deep concept in number theory with wide application to many areas of number theory. In this article we introduce the conjecture and give examples of its applications. In particular we apply the $abc$…

This paper describes a method used to construct infinitely many probable counterexamples of the abc conjecture over the rational integers.

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…

In this paper we study the logical foundations of automated inductive theorem proving. To that aim we first develop a theoretical model that is centered around the difficulty of finding induction axioms which are sufficient for proving a…

A recent heuristic argument based on basic concepts in spectral analysis showed that the twin prime conjecture and a few other related primes counting problems are valid. A rigorous version of the spectral method, and a proof of the more…

We study the Euler-Frobenius numbers, a generalization of the Eulerian numbers, and the probability distribution obtained by normalizing them. This distribution can be obtained by rounding a sum of independent uniform random variables; this…

In this paper, we prove: Let A be a nonnegative primitive tensor with order m and dimension n. Then its primitive degree R(A)\leq (n-1)^2+1, and the upper bound is sharp. This confirms a conjecture of Shao [7].

I study the sequences of Euler and Springer numbers from the point of view of the classical moment problem.

We consider some parametrized classes of multiple sums first studied by Euler. Identities between meromorphic functions of one or more variables generate reduction formulae for these sums.

Legendre's Conjecture is one of the most elegant open problems in Number Theory, which states that there is a prime between consecutive two perfect squares. In this note, we prove the conjecture holds true and also discuss the related…

We pose 100 new conjectures on representations involving primes or related things, which might interest number theorists and stimulate further research. Below are five typical examples: (i) For any positive integer $n$, there exists…

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…

Let $p_n$ be $n$th prime, and let $(S_n)_{n=1}^\infty:=(S_n)$ be the sequence of the sums of the first $2n$ consecutive primes, that is, $S_n=\sum_{k=1}^{2n}p_k$ with $n=1,2,\ldots$. Heuristic arguments supported by the corresponding…

The non-transitivity without extra constraints in the Euler equation in any dimension is almost evident and can be derived, e.g., from Morse theory.

In this note we will discuss Euler's solution of the simple difference equation that he gave in his paper{\it ``De serierum determinatione seu nova methodus inveniendi terminos generales serierum"} \cite{E189} (E189:``On the determination…

Let $\lambda (n)$ denote the Liouville function. Complementary to the prime number theorem, Chowla conjectured that \vspace{1mm} \noindent {\bf Conjecture (Chowla).} {\em \begin{equation} \label{a.1} \sum_{n\le x} \lambda (f(n)) =o(x)…

"Goldbach's Conjecture" proven by analysis of how all combinations of the odd primes, summed in pairs, generates all of the even numbers.

I attempted to write the full translation of this article to make the remarkable proof of Pierre Deligne available to a greater number of people. Overviews of the proofs can be found elsewhere. I especially recommend the notes of James…

With the formula of Gandhi you can determine the on $p_n$ immedately subsequent prime $p_{n+1}$ from the knowledge of the primes $p_1, p_2, ... , p_n$. An elementary proof of its trueness will be detailed shown in this paper. Finally the…

In this article, we will use elementary number theory techniques to investigate a sequence of integers defined by a sifting process called the lucky numbers. Ulam introduced lucky numbers as a sieve-based analogue of prime numbers. We…