We demonstrate a new quantitative method to the sieve of Eratosthenes, which is an alternative to the sieve of Legendre. In this method, every element of a given set is sifted out once only, and therefore, this method is free of the Mobius function and of the parity barrier. Using this method, we prove that every sufficiently large even number is the sum of two primes, and that every even number is the difference of two primes in infinitely many ways.

We study C*-algebraic versions of following conjectures/theorems: (1) Bieberbach conjecture (de Branges theorem) (2) Robertson conjecture (3) Lebedev-Milin conjecture (4) Zalcman conjecture (5) Krzyz conjecture (6) Corona conjecture (Carleson theorem). We prove that the C*-algebraic Bieberbach Conjecture for invertible coefficients is true for second degree C*-algebraic polynomials.

Build a special identical equation, use its calculation characters to prove and search for solution of any odd converging to 1 equation through (*3+1)/2^k operation, change the operation to (*3+2^m-1)/2^k, and get a solution for this equation, give a specific example to verify. Thus prove the Collatz Conjecture is true. Furthermore, analysis the sequences produced by iteration calculation during the procedure of searching for solution, build a weight function model, prove it decrease progressively to 0, build a complement weight function model, prove it increase to its convergence state. Build a (*3+2^m-1)/2^k odd tree, prove if odd in (*3+2^m-1)/2^k long huge odd sequence can not converge, the sequence must outstep the boundary of the tree after infinite steps of (*3+2^m-1)/2^k operation.

The 3x+1 problem asks the following: Suppose we start with a positive integer, and if it is odd then multiply it by 3 and add 1, and if it is even, divide it by 2. Then repeat this process as long as you can. Do you eventually reach the integer 1, no matter what you started with? Collatz conjecture (or 3n+1 problem) has been explored for about 85 years. In this paper, we convert an integer number from decimal to binary number, and convert the Collatz function to binary function, which is multiplication and division of two binary numbers. Finally the iternation of the Collatz function, eventually reach the integer 1, thus we solve the 3x+1 problem completely.

In this research a neccessary and sufficient condition for the proof of the Binary Goldbach conjecture is established. It is established that the square of all natural numbers greater or equal to 2 have an additive partition equal to the sum of the square of a natural number greater or equal to zero and a Goldbach partition semiprime. All Goldbach partition semiprimes are odd except 4. This finding is in itself proof all composite even numbers have at least Goldbach partition. The result of the proof of the Binary Goldbach conjecture is used to prove the Andrica and Legendre conjectures. The Riemann hypothesis is examined and sources of non trivial zeroes outside the critical strip are discussed. An example example of a non-trivial zero outside the critical strip is given

In 1937,German mathematician L.Collatz proposed the following conjeture:for any positive integer,if it is even,divide it by 2,if it is odd,multiply it by 3 and add 1 to get an even number.Continuing with the above rule, the final result will be 1.This paper gives a proof of this conjecture.

It is due to Littlewood that the truth of the Riemann theorem implies that of the Lindel\"{o}f conjecture. This paper aims to use the idea of Littlewood to prove the Lindel\"{o}f conjecture for the Riemann zeta function. The Lindel\"{o}f $\mu $ function at the critical line is zero, with use of the Riemann theorem for the entire Riemann zeta function, proved based on the work of Heath-Brown. Our result is given to show that the Lindel\"{o}f conjecture, connected with the proof of the moment conjecture, is true.

Here we analyze three well-known conjectures: (i) the existence of infinitely-many twin primes, (ii) Goldbach’s strong conjecture, and (iii) Polignac’s conjecture. We show that the three conjectures are related to each other. In particular, we see that in analysing the validity of the Goldbach’s strong conjecture, one must consider also the existence of an infinite number of twin primes. As a consequence of how we approach this analysis, we also observe that if this conjecture is true, then so is Polignac’s conjecture. Our first step is an analysis of the existence of infinitely-many twin primes numbers. For this, using the formula 4((n−1)!+1) ≡ −n (mod n(n + 2)) – satisfied if and only if (n, n + 2) are twin primes –, together with Wilson’s theorem, we obtain conditions that must be met for two numbers to be twin primes. Our results, obtained from an analytic and functional study, lead us to conclude that there may exist infinitely-many twin primes. Next, we consider the validity of the Goldbach’s strong conjecture. After showing that the conjecture is true for the first even numbers, we notice a pattern that we analyze for any even number, reducing it to three cases: (i) when the even number 2n is two times a prime number n; (ii) when the even number 2n is such that n = 2m, with 2m − 1 and 2m + 1 twin primes; (iii) all other cases, i.e., for any 2n even number ∀n ∈ N with n > 1, n prime or not, with independence of n = 2m being 2m−1 and 2m+1 twin primes or not. In this last case we show that one can always find a certain r ∈ N such that 1 < r < n satisfying that n−r and n+r are primes, so that their sum is 2n. In this case we use the reduction to absurd method, and our results lead us to conclude that Goldbach’s strong conjecture is true to the best of our calculations, as well as the Polignac’s conjecture.

This study focuses on one of the most famous open problems in mathematics, namely the Collatz conjecture. The Collatz conjecture or 3x + 1 Problem is perhaps today's most enigmatic unsolved mathematical problem. It is named after Lothar Collatz, who rst proposed it in 1937. It may be stated as as follow: Take any positive integer n. If n is even then divide it by 2, else do \triple plus one" and get 3n + 1. The conjecture is that this process will eventually reach the number 1, regardless of which positive integer is chosen initially. In this paper, we present a simple proof for the Collatz conjecture.

The maximal prime gaps upper bound problem is one of the major mathematical problems to date. The objective of the current research is to develop a standard which will aid in the understanding of the distribution of prime numbers. This paper presents theoretical results which originated with a researchin the subject of the maximal prime gaps. the document presents the sharpest upper bound for the maximal prime gaps ever developed. The result becomes the Supremum bound on the maximal prime gaps and subsequently culminates with the conclusive proof of the Firoozbakht's Hypothesis No 30. Firoozbakht's Hypothesis implies quite a bold conjecture concerning the maximal prime gaps. In fact it imposes one of the strongest maximal prime gaps bounds ever conjectured. Its truth implies the truth of a greater number of known prime gaps conjectures, simultaneously, the Firoozbakht's Hypothesis disproves a known heuristic argument of Granville and Maier. This paper is dedicated to a fellow mathematician, the late Farideh Firoozbakht.

Komlos conjecture is about the existing of a constant upper bound over the dimension n of the function $K(n)$ defined by $$K(n)=max_{ \{ \overrightarrow{V_1},...,\overrightarrow{V_n} \} \in \{ \overrightarrow{V_i} \in { R}^n \| \overrightarrow{V_i} \| \leq 1 \} ^n } min_{ \{\epsilon_1,...\epsilon_n\} \in \{-1,+1\}^n } \|\sum_{i=0}^{n} \epsilon_i \overrightarrow{V_i}\}\|_{\infty} $$ In this paper, the function $K(n)$ is evaluated first for lower dimensions, $n\leq 5$, where it found that $K(2)=\sqrt{2}$. For higher dimension, the function $f(n)=\sqrt{ n-\lceil\log_2(2^{n-1}/n) \rceil}$ is found to be a lower bound for the function $K(n)$, from where it is concluded that the Komlos conjecture is false i.e., the universal constant $k=max_{n \in N} K(n) $ does not exist because of $$\lim_{n \rightarrow \infty } K(n) \geq \lim_{n \rightarrow \infty } \sqrt{ \log_2(n)-1 }=+\infty$$

This paper addresses a variant of the product for the Dirichlet $L$--functions. We propose a completely detailed proof for the truth of the generalized Riemann conjecture for the Dirichlet $L$--functions, which states that the real part of the nontrivial zeros is $1/2$. The Wang and Hardy--Littlewood theorems are also discussed with removing the need for it. The results are applicable to show the truth of the Goldbach's conjecture.

This paper asserts that the falsity of Goldbach Conjecture results in the breakdown of Trichotomy Law. Assuming that Goldbach Conjecture breaks down at an even integer 2n, where n ≥ 3, we note that the differences of 2n with the odd primes in the interval (1, n) are composite integers. We form a product δ of the collection of the least prime factors of these composite integers. We show that for a base case this product breaks Trichotomy Law. With the inductive hypothesis that such is the case with 2n, we prove that for all even integers the breakdown of Goldbach Conjecture entails the breakdown of Trichotomy Law.

In this paper, we demonstrate the Collatz conjecture using the mathematical complete induction method. We show that this conjecture is satisfied for the first values of natural numbers, and in analyzing the sequence generated by odd numbers, we can deduce a formula for the general term of the Collatz sequence for any odd natural number n after several iterations. This formula is used in one case that we analyze using the mathematical complete induction method in the process of demonstrating the conjecture.

Collatz conjecture states that an integer $n$ reduces to $1$ when certain simple operations are applied to it. Mathematically, the Collatz function is written as $f^k(n) = \frac{3^kn + C}{2^{z}}$, where $z, k, C \geq 1$. Suppose the integer $n$ violates Collatz conjecture by reappearing as $2^in$, where $i \geq 1$, then the equation modifies to $n \left(1 - \frac{3^k}{2^{z}2^i}\right) = \frac{C}{2^{z}2^i}$. The article takes an elementary approach to this problem by calculating the bounds on the values of $\frac{C}{2^{z}2^i}$ and $1 - \frac{3^k}{2^{z}2^i}$. Correspondingly, an upper limit on the integer $n$ is placed that can re-appear in the sequence. The integer $n$ lies in the $(-\infty, 5)$ range, and the limit on the number of odd steps is $k < 3$. Finally, it is shown that no integer chain exists that does not lead to 1.

The Goldbach Conjecture, which is frequently termed as “1 + 1”, has been a fascinating goal for many mathematicians over centuries. A Chinese mathematician, Dr. Jingrun Chen, proved 1 + 2, which is a great success and the best result so far achieved. Although there were several attempts proving the conjecture, these attempts are either tediously long, complicated, or logically imperfect, thus not widely accepted. Taking advantage of the periodicity of primes, here the author provides a straight forward rigorous proof for the Conjecture.

The environment impacts human health in profound ways, yet few theories define the form of the relationship between human physiology and the environment. Under current epidemiological constructs of causation, it is assumed that two complex systems (environment and humans) can transfer information directly. This is the underlying structure of the relationship when studies examine, for example, air pollution and brain health. In marked contrast, we conjecture that complex systems cannot interact directly, but rather such interaction requires the formation of an “interface”. Further, we contend that this dynamic, process-based interface incorporates components from all the interacting systems but exhibits operational independence. This property has many consequences, the foremost being that characteristics of the interface cannot be fully resolved by only studying the systems involved in the interaction. The interface itself must be the subject of inquiry. Without refocusing our attention on biodynamic interfaces, we cannot discern how our environment impacts health.

This article contains the theorems concerning the algebraic dependence of polynomial mappings with the constant Jacobian having two zeros at infinity. The work is related to the issues of the classical Jacobian Conjecture. This hypothesis affirm that the polynomial mapping of two complex variables with constant non-zero Jacobian is invertible. The Jacobian Conjecture is equivalent to the fact that polynomial mappings with constant non-zero Jacobian do not have two zeros at infinity, therefore it is equivalent to the two theorems given in the work. The proofs of these theorems proceeds by induction.

In mathematics, the Riemann hypothesis is a conjecture that the Riemann zeta function has its zeros only at the negative even integers and complex numbers with real part 1/2. Many consider it to be the most important unsolved problem in pure mathematics. It is one of the seven Millennium Prize Problems selected by the Clay Mathematics Institute to carry a US 1,000,000 prize for the first correct solution. We prove the Riemann hypothesis using the Complexity Theory. Number theory is a branch of pure mathematics devoted primarily to the study of the integers and integer-valued functions. The Goldbach's conjecture is one of the most important and unsolved problems in number theory. Nowadays, it is one of the open problems of Hilbert and Landau. We show the Goldbach's conjecture is true using the Complexity Theory as well. An important complexity class is 1NSPACE(S(n)) for some S(n). These mathematical proofs are based on if some unary language belongs to 1NSPACE(S(log n)), then the binary version of that language belongs to 1NSPACE(S(n)) and vice versa.

In experimental physics, we understand time as the duration of material changes that run into space. This fact is the standpoint for our model of time-invariant space in which causality is only a principle and not a physical actuality, and entropy runs only in space and not in time. Time is merely a duration of entropy that is increasing in time-invariant space. Time is entering existence when measured by the observer. In time-invariant space, motion happens only in space and not in time which means that also in open timelike curves motion happens only in space and not in time.

Using the local bijectivity of Keller maps, we give a proof of two-dimensional Jacobian conjecture.

In this paper, we examine the weak abc conjecture and the strong abc conjecture using some functions. we attempt to discuss the possibilty that the negative consequence of the weak abc conjecture. Namely, we derive that the weak abc conjecture is not true. Additionally, we show that the strong abc conjecture is not true.

Since 1742, the year in which the Prussian Christian Goldbach wrote a letter to Leonhard Euler with his Conjecture in the weak version, mathematicians have been working on the problem. The tools in number theory become the most sophisticated thanks to the resolution solutions. Euler himself said he was unable to prove it. The weak guess in the modern version states the following: any odd number greater than 5 can be written as the sum of 3 primes. In response to Goldbach's letter, Euler reminded him of a conversation in which he proposed what is now known as Goldbach's strong conjecture: any even number greater than 2 can be written as a sum of 2 prime numbers. The most interesting result came in 2013, with proof of weak version by the Peruvian Mathematician Harald Helfgott, however the strong version remained without a definitive proof. The weak version can be demonstrated without major difficulties and will not be described in this article, as it becomes a corollary of the strong version. Despite the enormous intellectual baggage that great mathematicians have had over the centuries, the Conjecture in question has not been validated or refuted until today.

In this paper, we present the definition, some properties, and solve a problem on special primes. These properties help in providing us with a better understanding of the problem posed related to special primes on the open problem garden website. The problem involves finding all the primes q, given a prime p such that q≡1(mod p) and 2^((q−1)/p)≡1(mod q). We prove that a prime number q is a special prime of p if and only if the order of 2 in U(q) divides q−1p. Also, we prove that a prime number q is not a special prime for any prime number if 2 is a generator of the group U(q) and that there exist infinitely many special primes for any given prime number.

Let $S=\left(s_1, \ldots, s_n\right)$ be a finite sequence of integers. Then $S$ is a Gilbreath sequence of length $n$, $S\in\mathbb{G}_n$, iff $s_1$ is even or odd and $s_2, \ldots, s_n$ are respectively odd or even and $\min\mathbb{K}_{\left(s_1, \ldots, s_m\right)}\leq s_{m+1}\leq\max\mathbb{K}_{\left(s_1, \ldots, s_m\right)}\forall m\in\left[\left.1, n\right)\right.$. This, applied to the order sequence of prime number $P$, defines Gilbreath polynomials and two integer sequences A347924 \cite{oeisA347924} and A347925 \cite{oeisA347925} which are used to prove that Gilbreath conjecture $GC$ is implied by $p_n-2^{n-1}\leqslant\mathcal{P}_{n-1}\left(1\right)$ where $\mathcal{P}_{n-1}\left(1\right)$ is the $n-1$-th Gilbreath polynomial at 1.

Starting with a positive odd integer $n$, apply a function $f(n)$ repetitively such that $f(n) = 3n + 1$ if $n \not\equiv 0 (\text{mod}\:2)$ or $f(n) = n/2$ if $n \equiv 0 (\text{mod}\:2)$. Let the sequence of all the odd integers obtained form an orbit $n, f^1(n) , f^2(n), \ldots, f^k(n), f^{k + 1}(n)$. The $k^{th}$ odd integer is written as $f^k(n) = (3^k + \mathbf{B(k)})/2^{\mathbf{z(k)}}$ where $\mathbf{B(k)}$ is the collection of terms without the coefficient $n$. We show that when $1 - \mathbf{B(k)}/(2^{\mathbf{z(k)}} n) \approx 1$, the condition for unbounded orbit is given by OEIS A022921. Further, if there exists at least one orbit for which $f^{k + 1}(n) = n$ when $(k + 1) < 3$, we show that there exists no orbit with $k + 1 > 3$ for which $f^{k + 1}(n) = n$. The final result is that the odd integers that can violate the Collatz conjecture are smaller than 5.

The following is the Collatz Conjecture: Suppose we begin with a positive number, multiply it by 3 and add 1 if it is odd, and divide it by 2 if it is even. Then continue doing this as long as you can. Will it matter where you start, whether you end up at the number 1? The Collatz conjecture has been studied for around 85 years. We transform the Collatz function from decimal to binary, then use the binary string's character to prove the Collatz conjecture. In addition, we use mathematics to give another interpretation to chaos, which is the ultimately periodic positive integer sequence.

The present paper deals with a class of even entire functions of order $\rho =1$ and genus $\vartheta =0$ of the polynomials form, \[ \sum\limits_{m=0}^\infty {\frac{\left( {-1} \right)^m\Phi ^{\left( {2m} \right)}\left( 0 \right)}{\Gamma \left( {2m+1} \right)}x^{2m}} =\Phi \left( 0 \right)\prod\limits_{k=1}^\infty {\left( {1-\frac{x}{\ell _k }} \right)} , \] where $\Phi\left( 0 \right)\ne 0$, real numbers $x$, nonnegative integers $m$, and $\ell _k \ne 0$ are all of the nonzero roots with $\sum\limits_{k=1}^\infty {1/\left| {\ell _k } \right|} <\infty $ and natural numbers $k$. We provide an efficient criterion for the polynomials with only real zeros. We also prove that the conjecture of Jensen is our special case.

The two main strategies used in this study are the binary representation and the decomposition of a natural number into many compound functions of odd function and even function. The Collatz conjecture regarding odd even numbers in number theory can be examined and discussed using them in this way: The sequence created by the finite iterations of the Collatz function becomes the ultimately periodic sequence if any natural number is the beginning value, proving the conjecture that has been held for 85 years.

The Harmonic Graphs Conjecture states that there exists an asymptotic relation involving the Harmonic Index and the natural logarithm as the order of the graph increases. This conjecture, grounded in the novel context of Prime Graphs, draws upon the Prime Number Theorem and the sum of divisors function to unveil a compelling asymptotic connection. By carefully expanding the definitions of the harmonic index and the sum of divisors function, and leveraging the prime number theorem's approximations, we establish a formula that captures this intricate relationship. This work is an effort to contribute to the advancement of graph theory, introducing a fresh lens through which graph connectivity can be explored. The synthesis of prime numbers and graph properties not only deepens our understanding of structural complexity but also paves the way for innovative research directions.

The 3x+1 problem is a problem of continuous iteration for integers. According to the basic theorem of arithmetic and the way of iteration, we derive a general formula for continuous iteration for odd integers. Through this formula, we can construct a loop iteration equation and obtain the result of the equation: the equation has only one positive integer solution. In addition, this general formula can be converted into a linear indeterminate equation. The process of solving this equation shows that the relationship between the iteration result and the odd number being iterated is linear. Extending this result to all positive even numbers, we get the answer to the 3x + 1 question.

This paper addresses the Collatz Conjecture, an open question in mathematics that postulates all positive integers will eventually reach one when a pair of specific operations are repeatedly applied. Despite its apparent simplicity, the conjecture lacks a formal proof. To tackle this enigma, we introduce Algebraic Inverse Trees (AITs), data structures that trace inverse operations of the Collatz sequence. This new approach not only elaborates our unique methodology but also sheds light on the underlying complexities of the Collatz Conjecture.

We propose Reduced Collatz Conjecture that is equivalent to Collatz Conjecture, which states that every positive integer can return to an integer less than it, instead of 1. Reduced Collatz Conjecture should be easier because some properties are presented in reduced dynamics, rather than in original dynamics (e.g., ratio and period). Reduced dynamics is a computation sequence from starting integer to the first integer less than it, and original dynamics is a computation sequence from starting integer to 1. Reduced dynamics is a component of original dynamics. We denote dynamics of x as a sequence of either computations in terms of ``I'' that represents (3*x+1)/2 and ``O'' that represents x/2. Here 3*x+1 and x/2 are combined together, because 3*x+1 is always even and followed by x/2. We formally prove that all positive integers are partitioned into two halves and either presents ``I'' or ``O'' in next ongoing computation. More specifically, (1) if any positive integer x that is i module $2^t$ (i is an odd integer) is given, then the first t computations (each one is either ``I'' or ``O'' corresponding to whether current integer is odd or even) will be identical with that of i. (2) If current integer after t computations (in terms of ``I'' or ``O'') is less than x, then reduced dynamics of x is available. Otherwise, the residue class of x (namely, i module $2^t$) can be partitioned into two halves (namely, i module $2^{t+1}$ and $i+2^t$ module $2^{t+1}$), and either half presents ``I'' or ``O'' in intermediately forthcoming (t+1)-th computation.

For any positive integer n ≥ 2, the Erdős-Straus Conjecture claims that the Diophantine equation 4/n = 1/x + 1/y + 1/z has a solution where x, y, z are also positive integers. In this paper, a directed network based on this equation is generated, with properties such as its average clustering coefficient, average path length, degree distributions, and largest strongly connected component analysed to reveal some underlying trends about the nature of the conjecture. Potential connections between different numbers, that result from satisfying a source-solution relationship for this equation, are described using the appropriate number-theoretic interpretations wherever possible, while conjectures backed by these trends are made in other instances. Additionally, a directed configuration model is used to show that the origin of several results is the degree sequence of the network. Metrics relating to the prime number nodes, specifically their in and out degrees, are also explored to yield some intriguing observations. On the whole, the aim is to highlight the viability of complex networks as a computational tool to study this general class of problems pertaining to fixed-length unit fraction splits.

The holographic principle states that the information about the volume of space is stored on its boundary. Assuming this holds, we can explain the aspects of gravity. It strongly seems that ”information” is a more fundamental entity than the structure of spacetime as used as basis in almost every gravity theory. In this paper, we present this connection between gravity and information. This naturally explains the four classical tests of gravity namely the gravitational redshift, the perihelion precession, the bending of light and the gravitational time delay. The spacetime need to be extended to 5D to explain gravity in this context.

Cryptocurrencies like Bitcoin rely on a proof-of-work system to validate transactions and prevent attacks or double-spending. A new proof-of-work is introduced which seems to be the first number theoretic proof-of-work unrelated to primes: it is based on a new metric associated to the Collatz algorithm whose natural generalization is algorithmically undecidable: the inflation propensity is defined as the cardinality of new maxima in a developing Collatz orbit. It is numerically verified that the distribution of inflation propensity slowly converges to a geometric distribution of parameter $0.714 \approx \frac{(\pi - 1)}{3}$ as the sample size increases. This pseudo-randomness opens the door to a new class of proofs-of-work based on congruential graphs.

Let $(\Omega, \mu)$, $(\Delta, \nu)$ be measure spaces and $\{\tau_\alpha\}_{\alpha\in \Omega}$, $\{\omega_\beta\}_{\beta \in \Delta}$ be 1-bounded continuous Parseval frames for a Hilbert space $\mathcal{H}$. Then we show that \begin{align}\label{UE} \log (\mu(\Omega)\nu(\Delta))\geq S_\tau(h)+S_\omega (h)\geq -2 \log \left(\frac{1+\displaystyle \sup_{\alpha \in \Omega, \beta \in \Delta}|\langle\tau_\alpha , \omega_\beta\rangle|}{2}\right) , \quad \forall h \in \mathcal{H}_\tau \cap \mathcal{H}_\omega, \end{align} where \begin{align*} &\mathcal{H}_\tau := \{h_1 \in \mathcal{H}: \langle h_1 , \tau_\alpha \rangle \neq 0, \alpha \in \Omega\}, \quad \mathcal{H}_\omega := \{h_2 \in \mathcal{H}: \langle h_2, \omega_\beta \rangle \neq 0, \beta \in \Delta\},\\ &S_\tau(h):= -\displaystyle\int\limits_{\Omega}\left|\left \langle \frac{h}{\|h\|}, \tau_\alpha\right\rangle \right|^2\log \left|\left \langle \frac{h}{\|h\|}, \tau_\alpha\right\rangle \right|^2\,d\mu(\alpha), \quad \forall h \in \mathcal{H}_\tau, \\ & S_\omega (h):= -\displaystyle\int\limits_{\Delta}\left|\left \langle \frac{h}{\|h\|}, \omega_\beta\right\rangle \right|^2\log \left|\left \langle \frac{h}{\|h\|}, \omega_\beta\right\rangle \right|^2\,d\nu(\beta), \quad \forall h \in \mathcal{H}_\omega. \end{align*} We call Inequality (\ref{UE}) as \textbf{Continuous Deutsch Uncertainty Principle}. Inequality (\ref{UE}) improves the uncertainty principle obtained by Deutsch \textit{[Phys. Rev. Lett., 1983]}. We formulate Kraus conjecture for 1-bounded continuous Parseval frames. We also derive continuous Deutsch uncertainty principles for Banach spaces.

Collatz conjecture (3n+1 problem) is an application of Cantor's isomorphism theorem (Cantor-Bernstein) under recursion. The set of 3n+1 for all odd positive integers n, is an order isomorphism for (odd X, 3X+1). The other (odd X, 3X+1) linear order has been discovered as a bijective order-embedding, with values congruent to powers of four. This is demonstrated using a binomial series as a set rule, then showing the isomorphic structure, mapping, and cardinality of those sets. Collatz conjecture is representative of an order machine for congruence to powers of two. If an initial value is not congruent to a power of two, then the iterative program operates the (odd X, 3X+1) order isomorphism until an embedded value is attained. Since this value is a power of four, repeated division by two tends the sequence to one. Because this same process occurs, regardless of the initial choice for a positive integer, Collatz conjecture is true.

A geometric Planck-scale model of quantum electrodynamics is tested against observations. Based on Dirac’s proposal to describe spin 1/2 particles as tethered objects, elementary fermions are conjectured to be fluctuating rational tangles with unobservable tethers. As Battey-Pratt and Racey showed, when such tangles propagate, they obey the free Dirac equation. Classifying rational tangles yields the observed spectrum of elementary fermions. Classifying deformations of tangle cores yields exactly three types of gauge interactions. They exchange three types of elementary gauge bosons and have the symmetry groups U(1), broken SU(2) and SU(3). The possible rational tangles for fermions, Higgs and gauge bosons allow only the observed Feynman diagrams. The complete Lagrangian of the standard model arises, including the Lagrangian of quantum electrodynamics. Over 50 tests of the tangle model are deduced. They include details on the perturbation expansion of the g-factor and the existence of limit values for electric and magnetic fields. Measurements agree with most tests, though this could change in the future. Some tests are genuine predictions that still need to be checked. In particular, the geometry of the process occurring at QED interaction vertices suggests an ab-initio estimate for the fine structure constant. In addition, the average geometric shapes of the elementary particle tangles suggest ab-initio lower and upper limits for the mass values of the electron and the other leptons.

This paper discusses a possible approach to validate the Goldbach conjucture which states that all even numbers can be expressed as a summation of two prime numbers. For this purpose the paper begins with the concept of successive-addition-of-digits-of-an-integer-number (SADN) and its properties in terms of basic algebraic functions like addition, multiplication and subtraction. This concept of SADN forms the basis for classifying all odd numbers into 3 series- the S1, S3 and S5 series- which comprise of odd numbers of SADN(7,4,1), SADN(3,9,6) and SADN(5,2,8) respectively and follow a cyclical order. The S1 and S5 series are of interest in the analysis since they include both prime and composite numbers while the S3 series exclusively consists of composite numbers. Furthermore, the multiplicative property of SADN shows why composites on the S1 series are derived as products of intra-series elements of the S1 and S5 series while composites on the S5 series are derived as products of inter-series elements of the S1 and S5 series. The role of SADN is also important in determining the relevant series for identifying the combination of primes for a given even number since it shows why such combinations for even numbers of SADN(1,4,7) will be found on the S5 series while those for even numbers of SADN(2,5,8) will lie on the S1 series and both the series have a role to play in identifying the prime number combinations for even numbers with SADN(3,6,9). Thereafter, the analysis moves to calculating the total number of acceptable combinations for a given even number that would include combinations in the nature of two composites (c1+c2), one prime and one composite (p+c) and two primes (p1+p2). A cyclical pattern followed by even numbers is also discussed in this context. Identifying the c1+c2 and p+c combinations and thereafter subtracting them from the total number of combinations will yield the number of p1+p2 combinations. For this purpose the paper discusses a general method to calculate the number of composites on the S1 and S5 series for a given number and provides a detailed method for deriving the number of c1+c2 combinations. The paper presents this analysis as a proof to validate the Goldbach conjecture. Since even numbers can be of SADN 1 to 9 and the relation between nTc (i.e. total number of acceptable combinations) and nc(i.e. number of composites) for all even numbers can either be of nTc > nc or nTc ≤ nc, the paper shows that the Goldbach conjecture is true for both these categories of even numbers. In this manner this analysis is totally inclusive of all even numbers in general terms and since the analysis of every even number is common in methodology but unique in compilation, apart from being totally inclusive, it is also mutually exclusive in nature. This proves that the Goldbach conjecture which states that all even numbers can be expressed as atleast one combination of two prime numbers holds true for all even numbers, across all categories possible. Additionally this approach proves that the identification of p1+p2 combinations which would validate the Goldbach conjecture lies in the identification of c1+c2 combinations.

Let $\mathbb{K}$ be a non-Archimedean (complete) valued field satisfying \begin{align*} \left|\sum_{j=1}^{n}\lambda_j^2\right|=\max_{1\leq j \leq n}|\lambda_j|^2, \quad \forall \lambda_j \in \mathbb{K}, 1\leq j \leq n, \forall n \in \mathbb{N}. \end{align*} For $d\in \mathbb{N}$, let $\mathbb{K}^d$ be the standard $d$-dimensional non-Archimedean Hilbert space. Let $m \in \mathbb{N}$ and $\text{Sym}^m(\mathbb{K}^d)$ be the non-Archimedean Hilbert space of symmetric m-tensors. We prove the following result. If $\{\tau_j\}_{j=1}^n$ is a collection in $\mathbb{K}^d$ satisfying $\langle \tau_j, \tau_j\rangle =1$ for all $1\leq j \leq n$ and the operator $\text{Sym}^m(\mathbb{K}^d)\ni x \mapsto \sum_{j=1}^n\langle x, \tau_j^{\otimes m}\rangle \tau_j^{\otimes m} \in \text{Sym}^m(\mathbb{K}^d)$ is diagonalizable, then \begin{align}\label{WELCHNONABSTRACT} \max_{1\leq j,k \leq n, j \neq k}\{|n|, |\langle \tau_j, \tau_k\rangle|^{2m} \}\geq \frac{|n|^2}{\left|{d+m-1 \choose m}\right| }. \end{align} We call Inequality (\ref{WELCHNONABSTRACT}) as the non-Archimedean version of Welch bounds obtained by Welch [\textit{IEEE Transactions on Information Theory, 1974}]. We formulate non-Archimedean Zauner conjecture.

In this paper, a short survey of the existed results concerning the Jacobian Conjecture is first given. Then the 3-fold linear type polynomial map will be analyzed in detail. The expansion of the Jacobian condition is deduced to obtain its equivalent algebraic equations, and the Jacobian condition will be analyzed to derive two coordinate transformations that can maintain the invariance of the Jacobian condition. Finally, it is proved by mathematical induction method that one general chain expression presented in this paper is just the inverse polynomial map of 3-fold linear type polynomial map, i.e. LJC(n,[3]) holds such that the Jacobian Conjecture holds.

Reptilians or reptoids are staple characters of Hollywood cinema, science fiction literature, ufology and conspiracy theories. Despite its popularity, the reptoid has been dismissed by the scientific community as a figment of the imagination; born out of a speculation, paranoia and wanton anthropocentricism. In this paper, however, the Life Sequence Conjecture is advanced as a supportive framework for the notion of reptilian extraterrestrials. This paper is not an argument in support of the existence of extraterrestrials. Rather, it proposes that if extraterrestrials do exist, then a reptilian morphology is not untenable.

In this paper, we propose an expansion of the Planck distribution function derived from the Boltzmann principle. Namely, we consider expanding Planck's law with a new distribution function, and discuss fine structure constant. Furthermore, using ideas applied to the expansion of the Planck distribution function, we show that Von Koch's inequality can be derived without using the Riemann Hypothesis, that is, the Riemann Hypothesis is true, and that the abc conjecture is negated. Furthermore, we define a generalization of Entropy and discuss that Entropy is relevant to dynamical systems described by logistic function models, such as the growth of bacteria or populations.

During the last century, entanglement was the bone of contention between the two main pillars of Physics: General Relativity (GR) and Quantum Mechanics (QM). This began in 1935 with the Einstein-Podolsky-Rosen paradox (EPR paradox) which concluded that although Quantum Mechanics is not wrong, it is an incomplete theory to represent physical reality. In this paper it is demonstrated that some byproducts resulting from entanglement and which we will call avatars act as a hinge that link both theories making the completeness of QM clear. Moreover, a thorough analysis of the non-locality of this effect will be carried out. Besides, it is demonstrated that entanglement is an instantaneous phenomenon and that it does not require the use of a superluminal signaling for this purpose. Finally, the avatars will also appear in each wormhole resulting from an entanglement process (WREP) demonstrating that they are traversable with an equivalent path of null length which can be crossed in a null time with all that this implies in Quantum Communications.

This research paper aims to explicate the complex issue of the Riemann's Hypothesis and ultimately presents its elementary proof. The method implements one of the binomial coefficients, to demonstrate the maximal prime gaps bound. Maximal prime gaps bound constitutes a comprehensive improvement over the Bertrand's result, and becomes one of the key elements of the theory. Subsequently, implementing the theory of the primorial function and its error bounds, an improved version of the Gauss' offset logarithmic integral is developed. This integral serves as a Supremum bound of the prime counting function Pi(n). Due to its very high precision, it permits to verify the relationship between the prime counting function Pi(n) and the offset logarithmic integral of Carl Gauss. The collective mathematical theory, via the Niels F. Helge von Koch equation, enables to prove the RIemann's Hypothesis conclusively.

Let $\Gamma_{\fbox{n}}(k)$ denote $(k-1)!$, where $n \in \{3,\ldots,14\}$ and $k \in \{2\} \cup \left\{2^{\textstyle 2^{n-3}}+1, 2^{\textstyle 2^{n-3}}+2, 2^{\textstyle 2^{n-3}}+3, \ldots\right\}$. For an integer $n \in \{3,\ldots,14\}$, let $\Sigma_n$ denote the following statement: if a system of equations ${\mathcal S} \subseteq \{\Gamma_{\fbox{n}}(x_i)=x_k:~i,k \in \{1,\ldots,n\}\} \cup \{x_i \cdot x_j=x_k:~i,j,k \in \{1,\ldots,n\}\}$ has only finitely many solutions in positive integers $x_1,\ldots,x_n$, then each such solution $(x_1,\ldots,x_n)$ satisfies $x_1,\ldots,x_n \leqslant 2^{\textstyle 2^{n-2}}$. The statement $\Sigma_6$ proves the following implication: if the equation $x(x+1)=y!$ has only finitely many solutions in positive integers $x$ and $y$, then each such solution $(x,y)$ belongs to the set $\{(1,2),(2,3)\}$. The statement $\Sigma_6$ proves the following implication: if the equation $x!+1=y^2$ has only finitely many solutions in positive integers $x$ and $y$, then each such solution $(x,y)$ belongs to the set $\{(4,5),(5,11),(7,71)\}$. The statement $\Sigma_9$ implies the infinitude of primes of the form $n^2+1$. The statement $\Sigma_9$ implies that any prime of the form $n!+1$ with $n \geqslant 2^{\textstyle 2^{9-3}}$ proves the infinitude of primes of the form $n!+1$. The statement $\Sigma_{14}$ implies the infinitude of twin primes. The statement $\Sigma_{16}$ implies the infinitude of Sophie Germain primes. A modified statement $\Sigma_7$ implies the infinitude of Wilson primes.

In this article we propose the integral, series and product representations for the Ramanujan zeta-function. We suggest a variant for the Conrey-Ghosh product for the entire Ramanujan zeta-function. We present some variants for the product for the Ramanujan $\Xi$-function. We prove that all of its zeros are real. Along the way we obtain the truth of the Riemann-Hardy conjecture.

We prove the continuous non-Archimedean (resp. p-adic) Banach space and Hilbert space versions of non-Archimedean (resp. p-adic) Welch bounds proved by M. Krishna. We formulate continuous non-Archimedean and p-adic functional Zauner conjectures.

We prove the non-Archimedean (resp. p-adic) Banach space version of non-Archimedean (resp. p-adic) Welch bounds recently obtained by M. Krishna. More precisely, we prove following results. \begin{enumerate}[\upshape(i)] \item Let $\mathbb{K}$ be a non-Archimedean (complete) valued field satisfying $\left|\sum_{j=1}^{n}\lambda_j^2\right|=\max_{1\leq j \leq n}|\lambda_j|^2$ for all $ \lambda_j \in \mathbb{K}, 1\leq j \leq n$, for all $n \in \mathbb{N}.$ Let $\mathcal{X}$ be a $d$-dimensional non-Archimedean Banach space over $\mathbb{K}$. If $\{\tau_j\}_{j=1}^n$ is any collection in $\mathcal{X}$ and $\{f_j\}_{j=1}^n$ is any collection in $\mathcal{X}^*$ (dual of $\mathcal{X}$) satisfying $f_j(\tau_j) =1$ for all $1\leq j \leq n$ and the operator $S_{f, \tau} : \text{Sym}^m(\mathcal{X})\ni x \mapsto \sum_{j=1}^nf_j^{\otimes m}(x)\tau_j^{\otimes m} \in \text{Sym}^m(\mathcal{X})$, is diagonalizable, then \begin{align}\label{NONFUNCTIONALWELCH} \max_{1\leq j,k \leq n, j \neq k}\{|n|, |f_j(\tau_k)f_k(\tau_j)|^{m} \}\geq \frac{|n|^2}{\left|{d+m-1 \choose m}\right| }. \end{align} We call Inequality (\ref{NONFUNCTIONALWELCH}) as non-Archimedean functional Welch bounds. \item For a prime $p$, let $\mathbb{Q}_p$ be the p-adic number field. Let $\mathcal{X}$ be a $d$-dimensional p-adic Banach space over $\mathbb{Q}_p$. If $\{\tau_j\}_{j=1}^n$ is any collection in $\mathcal{X}$ and $\{f_j\}_{j=1}^n$ is any collection in $\mathcal{X}^*$ (dual of $\mathcal{X}$) satisfying $f_j(\tau_j) =1$ for all $1\leq j \leq n$ and there exists $b \in \mathbb{Q}_p$ such that $ \sum_{j=1}^{n}f_j^{\otimes m}(x) \tau_j^{\otimes m} =bx$ for all $ x \in \text{Sym}^m(\mathcal{X}),$ then \begin{align}\label{PADICFUNCTIONALWELCH} \max_{1\leq j,k \leq n, j \neq k}\{|n|, |f_j(\tau_k)f_k(\tau_j)|^{m} \}\geq \frac{|n|^2}{\left|{d+m-1 \choose m}\right| }. \end{align} We call Inequality (\ref{PADICFUNCTIONALWELCH}) as p-adic functional Welch bounds. \end{enumerate} We formulate non-Archimedean functional and p-adic functional Zauner conjectures.

Since there is not a clear consensus about the possibility for COVID-19 to be an airborne disease, exists a controversy regarding the need to use surgical masks to prevent its spread. Here, using the Kepler conjecture for ideal packaging, the number of virions of different sizes that can be accommodated inside droplets was calculated and are proportional to the 3^rd potency of the droplet/virion diameter. The differences between particles of 5 um and 100 μm are around four orders of magnitude, explaining why the airborne spread is much more difficult but still possible. There is no solid evidence yet that the airborne coronaviruses may reach enough concentration to infect, but this may be the case under certain circumstances. The WHO partially recognizes now this fact in a warning to health workers (from my point of view too late, as it was the declaration of a pandemic). Another issue is whether the virus stays infective in aerosols generated from patients. This has not been directly proved yet except with artificial aerosols, but there are no reasons why the virus cannot remain in the air and be infective if the viral charge and time of exposure are enough. We must also consider whether the virus can infect the intestine; there are some signs in this sense. Finally, and most importantly, we need to reduce interactions by using surgical masks to flatten the curve, leave the quarantine and avoid a rebound. For cultural reasons, a social distance of 2 meters (2M) is extremely hard to manage. Surgical masks do reduce the interactions in conditions of proximity and, therefore, help to “flatten the curve”. The WHO and CDC “laissez-faire” on this matter do not help and we are running out of time. Anticipated actions, such as the use of surgical masks for the general population, are critical.

It is known that the class of p-normed spaces (0 < p ≤ 1) is an important generalization of usual normed spaces with rich topological and geometrical structure, but the most of tools and general principles in nature with nonlinearity have not been developed yet, thus the main goal of this paper is to develop tools for nonlinear analysis under the framework of p-vector spaces. In particular, we first develop the general fixed point theorems which provide solutions to answer Schauder conjecture since 1930’s in the affirmative for p-vector spaces when p = 1 (which is just general topological vector spaces); then the one best approximation result for upper semi-continuous mappings is given, which is used as a powerful tool to establish fixed points for non-self set-valued mappings with either inward or outward set conditions; and finally we establish comprehensive existence results of solutions for Birkhoff-Kellogg Problems, and the general principle of nonlinear alternative by including Leray-Schauder alternative and related results. The results given in this paper not only include the corresponding results in the existing literature as special cases, but also expected to be useful tools for the study of nonlinear problems arising from theory to practice.