Related papers: A recurring pattern in natural numbers of a certai…
It is proven that, in any given base, there are infinitely many palindromic numbers having at most six prime divisors, each relatively large. The work involves equidistribution estimates for the palindromes in residue classes to large…
We consider two type of upper Hessenberg matrices which determinants are Fibonacci numbers. Calculating sums of principal minors of the fixed order of the first type leads us to convolved Fibonacci numbers. Some identities for these and for…
We show that there exists a bounded pattern of m consecutive primes for any m>0, that means a tuple H_m of m distinct non-negative integers h_i (i=1,2,...m) such that its translations contain arbitrarily long (finite) arithmetic…
We say a natural number $n$ is matchable if there is a bijection from the set of $\tau(n)$ divisors of $n$ to the set $\{1,2,\dots,\tau(n)\}$, where corresponding numbers are relatively prime. We show that the set of matchable numbers has…
We present the pattern underlying some of the properties of natural numbers, using the framework of complex networks. The network used is a divisibility network in which each node has a fixed identity as one of the natural numbers and the…
We begin by introducing an extension of the traditional abundancy index to imaginary quadratic rings with unique factorization. After showing that many of the properties of the traditional abundancy index continue to hold in our extended…
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 \emph{repdigit} is a natural number greater than 10 which has all of its base-10 digits the same. In this paper we find all examples of two repdigits adding to a square. The proofs lead to interesting questions about consecutive quadratic…
In this article we find some properties of certain types of entropies of a natural number. Also, regarding the entropy H of a natural number, introduced by Minculete and Pozna, we generalize this notion for ideals and we find some of its…
The Fibonacci sequence $\mathbb{F}$ is the fixed point beginning with $a$ of morphism $\sigma(a,b)=(ab,a)$. Since $\mathbb{F}$ is uniformly recurrent, each factor $\omega$ appears infinite many times in the sequence which is arranged as…
Champernowne famously proved that the number $0.(1)(2)(3)(4)(5)(6)(7)(8)(9)(10)(11)(12)...$ formed by concatenating all the integers one after another is normal base 10. We give a generalization of Champernowne's construction to various…
In this paper we consider a few Calculus optimization problems in which we notice peculiar patterns. In each of these cases there is a geometric explanation for the pattern showing that it is not just a coincidence.
In this work I look at the distribution of primes by calculation of an infinite number of intersections. For this I use the set of all numbers which are not elements of a certain times table in each case. I am able to show that it exists a…
This paper introduces permutation-invariant Niven numbers--a novel class of Niven numbers where all digit permutations (with leading zeros automatically ignored) must retain the Niven property. We demonstrate that there exist infinitely…
The concept of scattered polynomials is generalized to those of exceptional scattered sequences which are shown to be the natural algebraic counterpart of $\mathbb{F}_{q^n}$-linear MRD codes. The first infinite family in the first…
In this paper, we introduce and study the iterates of the following family of functions $\varphi_k$ defined on natural numbers which exhibits nice properties. $$\varphi_k(x)=\left\lbrace \begin{array}{ll} x+k, & \mbox{ if $x$ is prime;}\\…
The purpose of this paper is to introduce the concept of reflecting numbers to the realm of number theory and to classify reflecting numbers of certain types. For us, reflecting numbers are coming from congruent numbers, above congruent…
Let $\beta$ be a non-unit real algebraic integer greater than one and $\{a_{n}\}_{n \geq 0}$ be a sequence satisfying a linear recurrence relation $a_{n+3}=aa_{n+2}+ba_{n+1}+ca_{n}$. Under certain conditions, we prove that the number of…
Using the subdivision schemes theory, we develop a criterion to check if any natural number has at most one representation in the $n$-ary number system with a set of non-negative integer digits $A=\{a_1, a_2,\ldots, a_n\}$ that contains…
A code of the natural numbers is a uniquely-decodable binary code of the natural numbers with non-decreasing codeword lengths, which satisfies Kraft's inequality tightly. We define a natural partial order on the set of codes, and show how…