相关论文: A systematic and complete proof of the existence a…

We present a comprehensive survey of constructions of the real numbers (from either the rationals or the integers) in a unified fashion, thus providing an overview of most (if not all) known constructions ranging from the earliest attempts…

In this expository article, the real numbers are defined as infinite decimals. After defining an ordering relation and the arithmetic operations, it is shown that the set of real numbers is a complete ordered field. It is further shown that…

A perfect number is a number whose divisors add up to twice the number itself. The existence of odd perfect numbers is a millennia-old unsolved problem. This note proposes a proof of the nonexistence of odd perfect numbers. More generally,…

Generalizations of linear numeration systems in which the set of natural numbers is recognizable by finite automata are obtained by describing an arbitrary infinite regular language following the lexicographic ordering. For these systems of…

The set of prime numbers has been analyzed, based on their algebraic and arithmetical structure. Here by obtaining a sort of linear formula for the set of prime numbers, they are redefined and identified; under a systematic procedure it has…

We prove an interesting identity for the sum of determinants, which is a generalization of the sum of a geometric progression. The proof is quite long and a number of other identities are proved along the way. Some of the more elementary…

It is well known that the resolution method (for propositional logic) is complete. However, completeness proofs found in the literature use an argument by contradiction showing that if a set of clauses is unsatisfiable, then it must have a…

We believe we have made progress in the age-old problem of divisibility rules for integers. Universal divisibility rule is introduced for any divisor in any base number system. The divisibility criterion is written down explicitly as a…

We describe the Dedekind cuts explicitly in terms of non-standard rational numbers. This leads to another construction of a Dedekind complete totally ordered field or, equivalently, to another proof of the consistency of the axioms of the…

A permutiple is a natural number that is a nontrivial multiple of a permutation of its digits in some base. Special cases of permutiples include cyclic numbers (multiples of cyclic permutations of their digits) and palintiple numbers…

We present a new topological proof of the infinitude of prime numbers with a new topology. Furthermore, in this topology, we characterize the infinitude of any non-empty subset of prime numbers.

We demonstrate, using the symbolic method together with p-adic and resultant methods,the existence of systems with exactly one or two generalized symmetries. Since the existence of one or two symmetries is often taken as a sure sign (or as…

The notion of a k-automatic set of integers is well-studied. We develop a new notion - the k-automatic set of rational numbers - and prove basic properties of these sets, including closure properties and decidability.

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…

Let $b$ be a numeration base. A $b$-Niven number is one that is divisible by the sum of its base $b$ digits. We introduce high degree $b$-Niven numbers. These are $b$-Niven numbers that have a power greater than $1$ that is $b$-Niven…

We state and prove a general summation identity. The identity is then applied to derive various summation formulas involving the generalized harmonic numbers and related quantities. Interesting results, mostly new, are obtained for both…

We give an elementary probabilistic proof of a binomial identity. The proof is obtained by computing the probability of a certain event in two different ways, yielding two different expressions for the same quantity.

It is shown that the set of decimal palindromes is an additive basis for the natural numbers. Specifically, we prove that every natural number can be expressed as the sum of forty-nine (possibly zero) decimal palindromes.

In this paper some new ways of generalizing perfect numbers are investigated, numerical results are presented and some conjectures are established.

To determine whether a number is congruent or not is an old and difficult topic and progress is slow. The paper presents a new theorem when a prime number is a congruent number or not. The proof is not necessarily any simpler or shorter…