相关论文: A recurring pattern in natural numbers of a certai…

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.

Weird numbers are abundant numbers that are not pseudoperfect. Since their introduction, the existence of odd weird numbers has been an open problem. In this work, we describe our computational effort to search for odd weird numbers, which…

While the general form of even perfect numbers is well-known, the existence or non-existence of odd perfect numbers is still an open problem. We address this problem and prove that if a natural number is odd, then it's not perfect.

We give an algorithm to determine all the repeated concatenations, in a given base, of a natural number in a residue class. The author recently describes a particular sequence of $v$-palindromes that inspires this investigation. We also…

New exceptional (i.e. non-repeating) prime number multiplets are given and formulated in terms of arithmetic progressions, along with laws governing them. Accompanying repeating prime number multiplets are pointed out. Prime number…

We introduce a notion of palindromicity of a natural number which is independent of the base. We study the existence and density of palindromic and multiple palindromic numbers, and we raise several related questions.

We consider a family of integer sequences generated by nonlinear recurrences of the second order, which have the curious property that the terms of the sequence, and integer multiples of the ratios of successive terms (which are also…

A curious number is a palindromic number whose base ten representation has the form $a \ldots a b \ldots b a \ldots a$. In this paper, we determine all curious numbers that are perfect squares. Our proof involves reducing the search for…

In this article some difficulties are deduced from the set of natural numbers. By using the method of transfinite recursion we define an iterative process which is designed to deduct all the non-greatest elements of the set of natural…

Prime numbers are fascinating by the way they appear in the set of natural numbers. Despite several results enlighting us about their repartition, the set of prime numbers is often informally qualified as misterious. In the present paper,…

In this paper we study some structure properties of primitive weird numbers in terms of their factorization. We give sufficient conditions to ensure that a positive integer is weird. Two algorithms for generating weird numbers having a…

We introduce \emph{patterned numbers}, a digit--divisor-based classification of integers motivated by recreational mathematics. A number is defined to be patterned if at least one of its positive divisors appears as a digit in its base-10…

Natural numbers from 0 to 11111 are written in terms of 1 to 9 in two different ways. The first one in increasing order of 1 to 9, and the second one in decreasing order. This is done by using the operations of addition, multiplication,…

The infinite numbers of the set M of finite and infinite natural numbers are defined starting from the sequence 0\Phi, where 0 is the first natural number, \Phi is a succession of symbols S and xS is the successor of the natural number x.…

In this paper, we prove the conjecture that if there is an odd perfect number, then there are infinitely many of them.

We describe a theory of finite sets, and investigate the analogue of Dedekind's theory of natural number systems (simply infinite systems) in this theory. Unlike the infinitary case, in our theory, natural number systems come in differing…

It is shown that the set of palindromes is an additive basis for the natural numbers in any base. Specifically, we prove that every natural number can be expressed as the sum of $O(d)$ palindromes in base $d$.

A decomposition of a natural number n is a sequence of consecutive natural numbers that sums to n. We construct a one-to-one correspondence between the odd factors of a natural number and its decompositions. We study the decompositions by…

In this work initial numbers and repunit numbers have been studied. All numbers have been considered in a decimal notation. The problem of simplicity of initial numbers has been studied. Interesting properties of numbers repunit are proved:…

We study the statistical properties of random numbers under the Martin-L\"of definition of randomness, proving that random numbers obey analogues of Strong Law of Large Numbers, the Law of the Iterated Logarithm, and that they are normal.…