It is widely held that irrational numbers can be represented by infinite digit-sequences. We will show that this is not possible. A digit sequence is only an abbreviated notation for an infinite sequence of rational p...It is widely held that irrational numbers can be represented by infinite digit-sequences. We will show that this is not possible. A digit sequence is only an abbreviated notation for an infinite sequence of rational partial sums. As limits of sequences, irrational numbers are incommensurable with any grid of decimal fractions.展开更多
By extending both arithmetical operations into finite sets of natural numbers, from the entire set of natural numbers successively deleting some residue classes modulo a prime, we invented a recursive sieve method or ...By extending both arithmetical operations into finite sets of natural numbers, from the entire set of natural numbers successively deleting some residue classes modulo a prime, we invented a recursive sieve method or algorithm on natural numbers and their sets. The algorithm mechanically yields a sequence of sets, which converges to the set of all primes p such that 2p + 1 divides the Mersenne number Mp. The cardinal sequence corresponding to the sequence of sets is strictly increasing. So that we have captured enough usable structures, without any estimation, the existing theories of those structures allow us to prove an exact result: there are infinitely many Mersenne composite numbers with prime exponents Mp.展开更多
文摘It is widely held that irrational numbers can be represented by infinite digit-sequences. We will show that this is not possible. A digit sequence is only an abbreviated notation for an infinite sequence of rational partial sums. As limits of sequences, irrational numbers are incommensurable with any grid of decimal fractions.
文摘By extending both arithmetical operations into finite sets of natural numbers, from the entire set of natural numbers successively deleting some residue classes modulo a prime, we invented a recursive sieve method or algorithm on natural numbers and their sets. The algorithm mechanically yields a sequence of sets, which converges to the set of all primes p such that 2p + 1 divides the Mersenne number Mp. The cardinal sequence corresponding to the sequence of sets is strictly increasing. So that we have captured enough usable structures, without any estimation, the existing theories of those structures allow us to prove an exact result: there are infinitely many Mersenne composite numbers with prime exponents Mp.
