相关论文: Simple proof of the integrality of the Somos-5 seq…

The Somos-5 sequence is defined by $a_{0} = a_{1} = a_{2} = a_{3} = a_{4} = 1$ and $a_{m} = \frac{a_{m-1} a_{m-4} + a_{m-2} a_{m-3}}{a_{m-5}}$ for $m \geq 5$. We relate the arithmetic of the Somos-5 sequence to the elliptic curve $E : y^{2}…

We provide an elementary proof to a conjecture by Robinson that multiples of (powers of) primes in the Somos-4 sequence are equally spaced. We also show, almost as a corollary, for the generalised Somos-4 sequence defined by…

We prove that, for any prime number $p\geq 5$, the set of natural numbers $n$ such that $p\mid H_n$ is finite.

The Somos 5 sequences are a family of sequences defined by a fifth order bilinear recurrence relation with constant coefficients. For particular choices of coefficients and initial data, integer sequences arise. By making the connection…

Somos 4 sequences are a family of sequences defined by a fourth-order quadratic recurrence relation with constant coefficients. For particular choices of the coefficients and the four initial data, such recurrences can yield sequences of…

For the sequence defined by a(n) = a(n-1) + gcd(n, a(n-1)) with a(1) = 7 we prove that a(n) - a(n-1) takes on only 1s and primes, making this recurrence a rare "naturally occurring" generator of primes. Toward a generalization of this…

We take the pre-sieved set to be all natural numbers $N=\{1,2,3,\dots\}$ with a sieve system:single sieve,double sieve,.... With single sieve, i.e. , remove out the multiple of a prime, we derive all the primes. With double sieve, i.e. ,…

We present a new sieve that allows us to find the prime numbers by using only regular patterns and, more importantly, avoiding any duplication of elements between them.

We present a simple, closed formula which gives all the primes in order. It is a simple product of integer floor and ceiling functions.

The main object of study in this paper is the well-known Somos-4 recurrence. We prove a theorem that any sequence generated by this equation also satisfies Gale-Robinson one. The corresponding identity is written in terms of its companion…

For the sequence defined by \[ a(n) = \frac{n^2 - n - 1}{\gcd\big(n^2 - n - 1,\, b(n-3) + n\,b(n-4)\big)} \] Where $b(n) = (n+2)\big(b(n-1) - b(n-2)\big),$ with initial conditions $b(-1) = 0$ and $b(0) = 1$, we find that $a(n)$ contains…

Let $p_n$ be $n$th prime, and let $(S_n)_{n=1}^\infty:=(S_n)$ be the sequence of the sums of the first $2n$ consecutive primes, that is, $S_n=\sum_{k=1}^{2n}p_k$ with $n=1,2,\ldots$. Heuristic arguments supported by the corresponding…

We derived the sum identities for generalized harmonic and corresponding oscillatory numbers for which a sieve procedure can be applied. The obtained results enable us to understand better the properties of these numbers and their…

In this paper it was shown that all prime numbers lie on 96 half-lines. At the same time, it was shown that if a given number does not lie on any of the above half-lines, then it is a composite number. A corresponding linear mathematical…

A Toda prime of an integer $n$ is an odd prime $p$ such that $4n=(p-1)k$ with $k$ coprime to $p$. We conjecture that every positive integer admits at least two Toda primes. We give a partial proof that every positive integer admits at least…

For $n=1,2,3,\ldots$ let $S_n$ be the sum of the first $n$ primes. We mainly show that the sequence $a_n=\root n\of{S_n/n}\ (n=1,2,3,\ldots)$ is strictly decreasing, and moreover the sequence $a_{n+1}/a_n\ (n=10,11,\ldots)$ is strictly…

By making use of only simple facts about congruence, we first show that every even Markoff number is congruent to 2 modulo 32, and then, generalizing an earlier result of Baragar, establish the uniqueness for those Markoff numbers c where…

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.

A Somos sequence of order $n$ is defined by a quadratic recurrence of width $n + 1$. Some of the remarkable properties of these sequences for small $n$ are tied to certain matrices built out of them being of finite rank. We give an…

This paper presents a distinctive prime detection approach. This method use GM-(n+1) sequences to effectively eliminate complex numbers. The sequences, which consist of odd a number of (n+1), exclude all components except for the initial…