The new logic of partitions is dual to the usual Boolean logic of subsets (usually presented only in the special case to the logic of propositions) in the sense that partitions and subsets are category-theoretic duals. The new information measure of logical entropy is just the normalized quantitative version of partitions. The new approach to interpreting quantum mechanics (QM) is showing that the mathematics (not the physics) of QM is the Hilbert space version of the mathematics of partitions. Or putting it the other way around, the math of partitions is a skeletal version of the math of QM. The key concepts throughout this progression from logic to information theory to quantum theory are distinctions versus indistinctions, definiteness versus indefiniteness, or distinguishability versus indistinguishability. The distinctions of a partitions are the ordered pairs of elements from the underlying set that are in different blocks of the partition. Logical entropy is defined (initially) as the normalized number of distinctions. The cognate notions of definiteness and distinguishability run through the math of QM, e.g., in the key non-classical notion of superposition (= ontic indefiniteness) and in the Feynman rules for adding amplitudes (indistinguishable alternatives) versus adding probabilities (distinguishable alternatives).

It is proved that there exist two odd prime numbers, p_i and p_j , such that p_i + p_j = 2r + 2(r ⩾ 2), where p_n denote the n-th odd prime number, 1 ⩽ i, j ⩽ n. By the theory of generating functions, we prove that there exist two positive integers, h_i and h_j , such that h_i + h_j = r(r ⩾ 2), where h_n = (p_n − 1)/2，(p_n ⩾ 3).Then we complete the proof.

The paper describes a method of solving some stochastic processes using generating functions. A general theorem of generating functions of a particular type is derived. A generating function of this type is applied to a stochastic process yielding polynomial time algorithms for certain partitions. The method is generalized to a stochastic process describing a rather general linear transform. Finally, the main idea of the method is used in deriving a theoretical polynomial time algorithm to the knapsack problem.

Logical information theory is the quantitative version of the logic of partitions just as logical probability theory is the quantitative version of the dual Boolean logic of subsets. The resulting notion of information is about distinctions, differences, and distinguishability, and is formalized using the distinctions (`dits') of a partition (a pair of points distinguished by the partition). All the definitions of simple, joint, conditional, and mutual entropy of Shannon information theory are derived by a uniform transformation from the corresponding definitions at the logical level. The purpose of this paper is to give the direct generalization to quantum logical information theory that similarly focuses on the pairs of eigenstates distinguished by an observable, i.e., qudits of an observable. The fundamental theorem for quantum logical entropy and measurement establishes a direct quantitative connection between the increase in quantum logical entropy due to a projective measurement and the eigenstates (cohered together in the pure superposition state being measured) that are distinguished by the measurement (decohered in the post-measurement mixed state). Both the classical and quantum versions of logical entropy have simple interpretations as "two-draw" probabilities for distinctions. The conclusion is that quantum logical entropy is the simple and natural notion of information for quantum information theory focusing on the distinguishing of quantum states.

In this article, we prove an orthogonal decomposition theorem for real inner product gyrogroups, which unify some well-known gyrogroups in the literature: Einstein, M\"{o}bius, Proper Velocity, and Chen's gyrogroups. This leads to the study of left (right) coset partition of a real inner product gyrogroup induced from a subgyrogroup that is a finite-dimensional subspace. As a result, we obtain gyroprojectors onto the subgyrogroup and its orthogonal complement. We construct also quotient spaces and prove an associated isomorphism theorem. The left (right) cosets are characterized using gyrolines (cogyrolines) together with automorphisms of the subgyrogroup. With the algebraic structure of the decompositions, we study fiber bundles and sections inherited by the gyroprojectors. Finally, the general theory is exemplified for the aforementioned gyrogroups.

This work is divided into two parts. In the first one the combinatorics of a new class of randomly generated objects, exhibiting the same properties as the distribution of prime numbers, is solved and the probability distribution of the combinatorial counterpart of the n-th prime number is derived, together with an estimate of the prime-counting function π(x). A proposition equivalent to the Prime Number Theorem (PNT) is proved to hold, while the equivalent of the Riemann Hypothesis (RH) is proved to be false with probability 1 (w.p. 1) for this model. Many identities involving Stirling numbers of the second kind and harmonic numbers are found, some of which appear to be new. The second part is dedicated to generalizing the model to investigate the conditions enabling both PNT and RH. A model representing a general class of random integer sequences is found, for which RH holds w.p. 1. The prediction of the number of consecutive prime pairs, as a function of the gap d, is derived from this class of models and the results are in agreement with empirical data for large gaps. A heuristic version of the model, directly related to the sequence of primes, is discussed and new integral lower and upper bounds of π(x) are found.