Prospects for the Use of Quasi-Mersen Numbers in the Design of Parallel-Serial Processors by Aruzhan Kadyrzhan, Kaisarali Kadyrzhan, Akhat Bakirov, Ibragim Suleimenov

“…It is shown that the processor of the proposed type can be based on the use of a set of adders modulo a quasi-Mersenne number, each of which operates independently. …”
Get full text

On the emergence of the Quanta Prime sequence by Moustafa Ibrahim

“…The investigation highlights the sequence’s contribution to the emergence of new primes and its embodiment of core mathematical constructs, including Mersenne numbers, Fermat numbers, Lucas numbers, Fibonacci numbers, the Chebyshev sequence, and the Dickson sequence. …”
Get full text

The 3𝑥+1 Problem as a String Rewriting System by Joseph Sinyor

“…(I) Every odd 𝑛∈𝐍 lies on a distinct 3𝑥+1 trajectory between two Mersenne numbers (2𝑘−1) or their equivalents, in the sense that every integer of the form (4𝑚+1) with 𝑚 being odd is equivalent to 𝑚 because both yield the same successor. …”
Get full text