Related papers: Some conjectures in elementary number theory
One presents many Concatenated and Operation Sequences, P-Q Relationships, Digital Sequences, Magic Squares, Prime Conjectures, k-Divisibility and Strong Divisibility Sequences, Geometric Conjectures, Proposed problems.
A classical problem in analytic number theory is to study the distribution of $\alpha p$ modulo 1, where $\alpha$ is irrational and $p$ runs over the set of primes. We consider the subsequence generated by the primes $p$ such that $p+2$ is…
The main purpose of this survey is to introduce an inexperienced reader to additive prime number theory and some related branches of analytic number theory. We state the main problems in the field, sketch their history and the basic…
Building on the concept of pretentious multiplicative functions, we give a new and largely elementary proof of the best result known on the counting function of primes in arithmetic progressions.
The problem of the least prime number in an arithmetic progression is one of the most important topics in Number Theory. In [11], we are the first to study the relations between this problem and Goldbach's conjecture. In this paper, we…
This paper describes a method used to construct infinitely many probable counterexamples of the abc conjecture over the rational integers.
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 for the…
They run our lives, if you believe the hype in the news, but there is no precise definition of "algorithms" which is generally accepted by the mathematicians, logicians and computer scientists who create and study them. My main aims here…
In this paper, we mainly study some properties of elementary n-Lie algebras, and prove some necessary and sufficient conditions for elementary n-Lie algebras, we also give the relations between elementary n-algebras and E-algebras.
This note highlights an interesting connection between Euler sums of even weight and prime numbers.
Formal languages are sets of strings of symbols described by a set of rules specific to them. In this note, we discuss a certain class of formal languages, called regular languages, and put forward some elementary results. The properties of…
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 twin primes conjecture is a very old problem. Tacitly it is supposed that the primes it deals with are finite. In the present paper we consider three problems that are not related to finite primes but deal with infinite integers. The…
In this paper, we pose many challenging conjectures on congruences involving binomial coefficients and Ap\'ery-like numbers.
New exceptional (i.e. non-repeating) prime number multiplets are given and formulated in terms of arithmetic progressions, along with laws governing them. Accompanying repeating prime number multiplets are pointed out. Prime number…
In the literature, we have various ways of proving irrationality of a real number. In this survey article, we shall emphasize on a particular criterion to prove irrationality. This is called nice approximation of a number by a sequence of…
Dickson conjectured that a set of polynomials will take on infinitely many simultaneous prime values. Later others, such as Hardy and Littlewood, gave estimates for the number of these primes. In this article we look at this conjecture,…
We discuss conjectures related to the following two conjectures: (1) for each complex numbers x_1,...,x_n there exist rationals y_1,...,y_n \in [-2^{n-1},2^{n-1}] such that \forall i \in {1,...,n} (x_i=1 \Rightarrow y_i=1) \forall i,j,k \in…
Motivated by the problem of finding finite versions of classical incompleteness theorems, we present some conjectures that go beyond ${\bf NP\neq co NP}$. These conjectures formally connect computational complexity with the difficulty of…
We report a rigorous theory to show the origin of the unexpected periodic behavior seen in the consecutive differences between prime numbers. We also check numerically our findings to ensure that they hold for finite sequences of primes,…