相关论文: Intrinsic palindromic numbers
We study the palindromic complexity of infinite words $u_\beta$, the fixed points of the substitution over a binary alphabet, $\phi(0)=0^a1$, $\phi(1)=0^b1$, with $a-1\geq b\geq 1$, which are canonically associated with quadratic non-simple…
All the already known results on self descriptive numbers, together with the demonstration of the uniqueness for bases greater than 6, are here obtained through a systematic scheme of proof and not trial and error. The proof is also…
The natural unit system, in which the value of fundamental constants such as c and h are set equal to one and all quantities are expressed in terms of a single unit, is usually introduced as a calculational convenience. However, we…
We examine connections between rationality of certain indefinite integrals and equilibrium of Coulomb charges in the complex plane.
In this paper some new ways of generalizing perfect numbers are investigated, numerical results are presented and some conjectures are established.
We define reflective numbers and their iterative summations. We provide classification of reflective numbers based on their iterative cyclical limits.
In this paper we study a sequence involving the prime numbers by deriving two asymptotic formulas and finding new upper and lower bounds, which improve the currently known estimates.
In this paper, we define an ordering relation for a set of complex numbers, and research the properties and theorems of the ordering, solve some simple complex inequalities with the ordering.
An integral basis of the simplest number fields of degree 3,4 and 6 over $\mathbb{Q}$ are well-known, and widely investigated. We generalize the simplest number fields to any degree, and show that an integral basis of these fields is…
In this paper we introduce several natural definitions of asymptotic independence of two sequences of random elements. We discuss their basic properties, some simple connections between them and connections with properties of weak…
We give here a constructive account of the frequentist approach to probability, by means of natural density. Using this notion of natural density, we introduce some probabilistic versions of the Limited Principle of Omniscience. Finally we…
A graph $G$ is defined encapsulating the number theoretic notion of the Fundamental Theorem of Arithmetic. We then provide a graph theoretic approach to the fundamental results on the coprimality of two natural numbers, through the use of…
The ideas of the constraint-based statistics are introduced. The axiom and six theorems of the constraint-based statistics are established.
Let $k\geq 2$ be a fixed natural number. We establish the existence of infinitely many pairs of consecutive primes $p_n$, $p_{n+1}$ satisfying $$ p_{n+1}-p_n\geq c\:\frac{\log p_n\: \log_2 p_n\: \log_4 p_n}{\log_3 p_n}\:,$$ with $c$ being a…
Two permutations of the natural numbers diverge if the absolute value of the difference of their elements in the same position goes to infinity. We show that there exists an infinite number of pairwise divergent permutations of the…
Given any two rational numbers $r_1$ and $r_2$, a necessary and sufficient condition is established for the three numbers $1$, $\cos (\pi r_1)$, and $\cos (\pi r_2)$ to be rationally independent. Extending a classical fact sometimes…
We consider finite trees with edges labeled by letters on a finite alphabet $\varSigma$. Each pair of nodes defines a unique labeled path whose trace is a word of the free monoid $\varSigma^*$. The set of all such words defines the language…
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.…
Consider the set of all natural numbers that are co-prime to primes less than or equal to a given prime. Then given a consecutive pair of numbers in that set with an arbitrary even gap, we prove there exists an unbounded number of actual…
We generalize recent work of Andrews, Just, and Simay on modular palindromic compositions and anti-palindromic compositions by viewing all compositions partially (modular) palindromic or anti-palindromic. More precisely, we enumerate…