Related papers: A recursion equation for prime numbers

Update: This work reproduces an earlier result of Peck, which the author was initially unaware of. The method of the proof is essentially the same as the original work of Peck. There are no new results. We show that the sum of squares of…

A study of certain Hamiltonian systems has lead Y. Long to conjecture the existence of infinitely many primes of the form $p=2[\alpha n]+1$, where $1<\alpha<2$ is a fixed irrational number. An argument of P. Ribenboim coupled with classical…

We show that if p is an odd prime then $$\sum_{k=0}^{p-1}E_kE_{p-1-k}=1 (mod p)$$ and $$\sum_{k=0}^{p-3}E_kE_{p-3-k}=(-1)^{(p-1)/2}2E_{p-3} (mod p),$$ where E_0,E_1,E_2,... are Euler numbers. Moreover, we prove that for any positive integer…

We describe an algorithm that takes as input a complex sequence $(u_n)$ given by a linear recurrence relation with polynomial coefficients along with initial values, and outputs a simple explicit upper bound $(v_n)$ such that $|u_n| \leq…

We obtain upper bounds on the number of finite sets $\mathcal S$ of primes below a given bound for which various $2$ variable $\mathcal S$-unit equations have a solution.

In this paper we prove a new recurrence relation on the van der Waerden numbers, $w(r,k)$. In particular, if $p$ is a prime and $p\leq k$ then $w(r, k) > p \cdot \left(w\left(r - \left\lceil \frac{r}{p}\right\rceil, k\right) -1\right)$.…

In this paper, we study a class of functions defined recursively on the set of natural numbers in terms of the greatest common divisor algorithm of two numbers and requiring a minimality condition. These functions are permutations, products…

Let $q_n$ denote the $n^{th}$ number that is a product of exactly two distinct primes. We prove that $$\liminf_{n\to \infty} (q_{n+1}-q_n) \le 6.$$ This sharpens an earlier result of the authors (arXivMath NT/0506067), which had 26 in place…

We give estimates from below for the greatest prime factor of the n-th term of a binary recurrence sequence.

We consider the problem of finding the set of permutations $r_j$ of $\{1,\cdots , n\}$ such that $\sum_{i=1}^n \prod_{j=1}^k r_j(i)$ is maximized or minimized. While the set of permutations maximizing this value are easily determined,…

Suppose that all primes are colored with k colors. Then there exist monochromatic primes p1, p2, p3 such that p1+p2=p3+1.

Let $r\geq 1$ be an integer, $\mathbf a=(a_1,\ldots,a_r)$ a vector of positive integers and let $D\geq 1$ be a common multiple of $a_1,\ldots,a_r$. In a continuation of a previous paper we prove that, if $D=1$ or $D$ is a prime number, the…

In this paper we prove two results. The first theorem uses a paper of Kim \cite{K} to show that for fixed primes $p_1,...,p_k$, and for fixed integers $m_1,...,m_k$, with $p_i\not|m_i$, the numbers $(e_{p_1}(n),...,e_{p_k}(n))$ are…

Let ${\mathcal{P}_{n}}$ denote the set of positive integers which are prime to $n$. Let $B_{n}$ be the $n$-th Bernoulli number. For any prime $p\ge 5$ and $r\ge 2$, we prove that \begin{equation} \sum\limits_{\begin{smallmatrix}…

Let $p$ be a prime and let $x$ be a $p$-adic integer. We provide two supercongruences for truncated series of the form $$\sum_{k=1}^{p-1} \frac{(x)_k}{(1)_k}\cdot \frac{1}{k}\sum_{1\le j_1\le\cdots\le j_r\le k}\frac{1}{j_1^{}\cdots…

Let $p$ and $q$ be two distinct fixed prime numbers and $(n_i)_{i\geq 0}$ the sequence of consecutive integers of the form $p^a\cdot q^b$ with $a,b\ge 0$. Tijdeman gave a lower bound (1973) and an upper bound (1974) for the gap size…

We present a prime-generating polynomial $(1+2n)(p -2n) + 2$ where $p>2$ is a lower member of a pair of twin primes less than $41$ and the integer $n$ is such that $\: \frac {1-p}{2} < n < p-1$.

A distinguishing feature of certain intractable problems in prime number theory is the sparsity of the underlying sequence. Motivated by the general problem of finding primes in sparse polynomial sequences, we give an estimate for the…

Let $R(n,k)$ denote the number of permutations of ${1,2,...,n}$ with $k$ alternating runs. In this note we present an explicit formula for the numbers $R(n,k)$.

We prove some theorems which give sufficient conditions for the existence of prime numbers among the terms of a sequence which has pairwise relatively prime terms.