Related papers: Binomial Coefficients and the Distribution of the …
Let $g(n)$ be the largest positive integer $k$ such that there are distinct primes $p_i$ for $1\leq i\leq k$ so that $p_i |n+i$. This function is related to a celebrated conjecture of C.A. Grimm. We establish upper and lower bounds for…
We studied two probabilistic models of the distribution of primes in the natural number [1].The paper considers the third probabilistic model of the distribution of primes in the natural number. The author proved that the results obtained…
Let pi(x) denote the number of primes smaller or equal to x. We compare sqrt{pi}(x) with sqrt{R}(x) and sqrt{li}(x), where R(x) and li(x) are the Riemann function and the logarithmic integral, respectively. We show a regularity in the…
The N distinct prime numbers that make up a composite number M allow $2^{N-1}$ bi partioning into two relatively prime factors. Each such pair defines a pair of conjugate representations. These pairs of conjugate representations, each of…
Let m_1,...,m_s be positive integers. Consider the sequence defined by multinomial coefficients: a_n=\binom{(m_1+m_2+... +m_s)n}{m_1 n, m_2 n,..., m_s n}. Fix a positive integer k\ge 2. We show that there exists a positive integer C(k) such…
A well-known conjecture asserts that, for any given positive real number $\lambda$ and nonnegative integer $m$, the proportion of positive integers $n \le x$ for which the interval $(n,n + \lambda\log n]$ contains exactly $m$ primes is…
This paper investigates coefficients of cyclotomic polynomials theoretically and experimentally. We prove the following result. {{\em If $n=p_1\ldots p_k$ where $p_i$ are odd primes and $p_1<p_2<\ldots<p_r<p_1+p_2<p_{r+1}<\ldots<p_t$ with…
We prove that for any nonnegative integers $n$ and $r$ the binomial sum $$ \sum_{k=-n}^n\binom{2n}{n-k}k^{2r} $$ is divisible by $2^{2n-\min\{\alpha(n),\alpha(r)\}}$, where $\alpha(n)$ denotes the number of 1's in the binary expansion of…
Let $f(x)=x^n+a_{n-1}x^{n-1}+\dots+a_0$ be an irreducible polynomial with integer coefficients. For a prime $p$ for which $f(x)$ is fully splitting modulo $ p$, we consider $n$ roots $r_i$ of $f(x)\equiv 0\bmod p$ with $0 \le r_1\le\dots\le…
Let $k \ge 2$ be an integer and consider the $k$-generalized Pell sequence $\{P_n^{(k)}\}_{n \ge 2-k}$, defined by the initial values $0, \ldots, 0, 0, 1$ (a total of $k$ terms), and the recurrence $P_n^{(k)} = 2P_{n-1}^{(k)} +…
The natural numbers divisible by the Prime Factors 2, 3, 5, 11, 13 and 17 lie on defined spiral graphs, which run through the Square Root Spiral. A mathematical analysis shows, that these spiral graphs are defined by specific quadratic…
Prime numbers are one of the most intriguing figures in mathematics. Despite centuries of research, many questions remain still unsolved. In recent years, computer simulations are playing a fundamental role in the study of an immense…
For a fixed integer $k \ge 0$, consider representations of positive integers as sums of binomial coefficients of the form $\binom{n}{k}$. While exact minimal bounds for the number of required summands are known only in a few low-dimensional…
Let $k$ and $n$ be positive integers, $n>k$. Define $r(n,k)$ to be the minimum positive value of $$ |\sqrt{a_1} + ... + \sqrt{a_k} - \sqrt{b_1} - >... -\sqrt{b_k} | $$ where $ a_1, a_2, ..., a_k, b_1, b_2, ..., b_k $ are positive integers…
In this article, we give a formula for the generalization of the binomial coefficient to the complex numbers as a linear combination of $\sinc$ functions. We then give a general formula to compute the integral on the real line of the…
The Erdos-Kac theorem, a foundational result in probabilistic number theory, states that the number of prime factors of an integer follows a Gaussian distribution. In this paper we develop and analyze probabilistic models for "random…
Let omega(n) be the number of prime divisors of an integer n. Let n be an integer taken at random between 1 and N. What can be said about the value then taken by omega(n)? What is its expected value? What is its distribution in the limit?…
Let p be a prime and let a be a positive integer. In this paper we determine $\sum_{k=0}^{p^a-1}\binom{2k}{k+d}/m^k$ and $\sum_{k=1}^{p-1}\binom{2k}{k+d}/(km^{k-1})$ modulo $p$ for all d=0,...,p^a, where m is any integer not divisible by p.…
For n=1,2,3,... let p_n be the n-th prime. We mainly show that p_n>n+sum_{k=1}^n p_k/k for all n>124, and sum_{k=1}^n kp_k<n^2p_n/3 for all n>30.
We show that the sequence of integers which have nearly the typical number of distinct prime factors forms a Poisson process. More precisely, for $\de$ arbitrarily small and positive, the nearest neighbor spacings between integers $n$ with…