Related papers: On the density of nice Friedmans
A binary string representation of prime occurrences is a sequence of bits, where $1$ entries encode positions of prime numbers. This is a convenient representation for analysis of prime distribution, since it allows for application of a…
Let n,p,k be three positive integers. We prove that the numbers binomial (n,k) 3F2 (1-k, -p, p-n ; 1, 1-n ; 1) are positive integers which generalize the classical binomial coefficients. We give two generating functions for these integers,…
We prove that any positive rational number is the sum of distinct unit fractions with denominators in $\{p-1 : p\textrm{ prime}\}$. The same conclusion holds for the set $\{p-h : p\textrm{ prime}\}$ for any $h\in\mathbb{Z}\backslash\{0\}$,…
The mathematical constant pi has recently been computed up to 22,459,157,718,361 decimal and 18,651,926,753,033 hexadecimal digits. As a simple check for the normality of pi, the frequencies of all sequences with length one, two and three…
A repdigit is a positive integer that has only one distinct digit in its decimal expansion, i.e., a number has the form $d(10^m-1)/9$ for some $m\geq 1$ and $1 \leq d \leq 9$. Let $\left(T_n\right)_{n\ge0}$ be the sequence of Tribonacci.…
In this paper we present and expand upon procedures for obtaining large d digit prime number to an arbitrary probability. We use a layered approach. The first step is to limit the pool of random number to exclude numbers that are obviously…
We show that the following are consistent with ZFC: 1. Strongly meager sets form an ideal with the same additivity as the ideal of meager sets. 2. There exists a strong measure zero set of size > d (dominating number).
For nonzero coprime integers $a$ and $b$, a positive integer $\ell$ is said to be \emph{good with respect to $a$ and $b$} if there exists a positive integer $k$ such that $\ell$ divides $a^{k} + b^{k}$. The concept of good integers has been…
A base-$g$ Niven number is a natural number divisible by the sum of its base-$g$ digits. We show that, for any $g\geq 3$, all sufficiently large natural numbers can be written as the sum of three base-$g$ Niven numbers. We also give an…
We establish a central limit theorem for counting large continued fraction digits $(a_n)$, i.e. we count occurrences $\{a_n>b_n\}$, where $(b_n)$ is a sequence of positive integers. Our result improves a similar result by Philipp which…
Based on the Goldbach conjecture and arithmetic fundamental theorem, the Goldbach conjecture was extended to more general situations, i.e., any positive integer can be written as summation of some specific prime numbers, which depends on…
In this paper, we obtain formulas for the number of representations of positive integers as sums of arbitrarily many squares (and other polygonal numbers) with a certain natural weighting. The resulting weighted sums give Fourier…
If $a>b$ and $n>1$ are positive integers and $a$ and $b$ are relatively prime integers, then a large Zsigmondy prime for $(a,b,n)$ is a prime $p$ such that $p \,|\, a^n-b^n$ but $p \,\nmid \, a^m-b^m$ for $1 \leq m < n$ and either $p^2 \, |…
Let $X$ be a sufficiently large positive integer. We prove that one may choose a subset $S$ of primes with cardinality $O(\log X)$, such that a positive proportion of integers less than $X$ can be represented by $x^2 + p y^2$ for at least…
We show that for every positive integer $k$, there exist $k$ consecutive primes having the property that if any digit of any one of the primes, including any of the infinitely many leading zero digits, is changed, then that prime becomes…
A nonempty finite set of positive integers A is relatively prime if gcd(A) = 1 and it is relatively prime to n if gcd(A [ fng) = 1. The number of nonempty subsets of A which are relatively prime to n is \Phi(A, n) and the number of such…
The Dickman function F(alpha) gives the asymptotic probability that a large integer N has no prime divisor exceeding N^alpha. It is given by a finite sum of generalized polylogarithms defined by the exquisite recursion L_k(alpha)=-…
In this article, we study the properties of $\psi$-amicable numbers. We prove that their asymptotic density relative to the positive integers is zero. We also propose generalizations of $\psi$-amicable numbers.
It has been established on many occasions that the set of quotients of prime numbers is dense in the set of positive real numbers. More recently, it has been proved that the set of quotients of primes in the Gaussian integers is dense in…
In this paper we present some observations about the well-known Goldbach conjecture. In particular we list and interpret some numerical results which allow us to formulate a relation between prime numbers and even integers. We can also…