Related papers: Ordinality and Riemann Hypothesis I
We consider an elementary discrete process which starts from purely random configuration and leads to well-ordered and stable state. Complete analytical solution to this problem is presented.
The Riemann Hypothesis is a conjecture that all non-trivial zeros of Riemann Zeta function are located on the critical line in the complex plane. Hundreds of propositions in function theory and analytic number theory rely on this…
We prove explicit versions of Cram\'er's theorem for primes in arithmetic progressions, on the assumption of the generalized Riemann hypothesis.
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,…
Assuming the Riemann hypothesis, this article discusses a new elementary argument that seems to prove that the maximal prime gap of a finite sequence of primes p_1, p_2, ..., p_n <= x, satisfies max {p_(n+1) - p_n : p_n <= x} <=…
Models of a generalized nondeterminism are defined by limitations on nonde- terministic behavior of a computing device. A regular realizability problem is a problem of verifying existence of a special sort word in a regular language. These…
Let $K$ be a number field, and let $G$ be a finitely generated subgroup of $K^\times$. Without relying on the Generalized Riemann Hypothesis we prove an asymptotic formula for the number of primes $\mathfrak p$ of $K$ such that the order of…
We study first-order concatenation theory with bounded quantifiers. We give axiomatizations with interesting properties, and we prove some normal-form results. Finally, we prove a number of decidability and undecidability results.
Recently, sufficient conditions of stability or instability for time-delay systems have been proven to be necessary. In this way, a remarkable necessary and sufficient condition has then been developed by Gomez et al. It is presented as a…
In the paper, the occurrence of zeros and ones in the binary expansion of the primes is studied. In particular the statement in the title is established. The proof is unconditional.
We extend the notions of "$R_\infty$-property" and "full (extended) Reidemeister spectrum" to finite groups in a meaningful way. We provide examples of finite groups admitting these properties, if they exist, by looking at groups of small…
The principle of the common cause claims that if an improbable coincidence has occurred, there must exist a common cause. This is generally taken to mean that positive correlations between non-causally related events should disappear when…
The standard conditional probability definition formula is derived as a consequence of the Insufficient Reason Principle expressed as the Maximum Relative Divergence Principle for grading (order-comonotonic) functions on a totally ordered…
The transformations of the sum identities for generalized harmonic and oscillatory numbers, obtained earlier in our recent report [1], enable us to derive the new identities expressed in terms of the corresponding square roots of x. At…
In this paper, we prove the conjecture that if there is an odd perfect number, then there are infinitely many of them.
The results of the study provide guidelines for the development and applications of algorithms. When the number of steps for calculating an assumption tends to infinity, probability theory can be applied to predict whether the assumption…
In this work we apply Hausdorff moment problem to prove a necessary and sufficient condition for a complex sequence to be positive. Then we apply it to a subclass of genus $0$ entire functions $f(z)$ to obtain an infinite family of…
This paper is a continuation of Arai's paper on derivability conditions for Rosser provability predicates. We investigate the limitations of the second incompleteness theorem by constructing three different Rosser provability predicates…
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…
We study the number of primes with a given primitive root and in an arithmetic progression under the assumption of a suitable form of the generalized Riemann Hypothesis. Previous work of Lenstra, Moree and Stevenhagen has given asymptotics…