Related papers: A Prime-Representing Constant

This note is devoted to study the recurrent numerical sequence defined by: $a_0 = 0$, $a_n = \frac{n}{2} a_{n - 1} + (n - 1)!$ ($\forall n \geq 1$). Although, it is immediate that ${(a_n)}_n$ is constituted of rational numbers with…

We prove the theorems which are equivalent to the Roland's results such that a new form of them allows to consider some generalizations. In particular, we give generators of primes more than a fixed prime.

Let $S= \{ p_1, \ldots, p_s\}$ be a finite, non-empty set of distinct prime numbers and $(U_{n})_{n \geq 0}$ be a linear recurrence sequence of integers of order $r$. For any positive integer $k,$ we define $(U_j^{(k)})_{j\geq 1}$ an…

Let $X$ be a positive integer and $t$ a real number great than 1. The family of sets $\left\{\big\lfloor\frac{X}{n^t}\big\rfloor ~:~ 1\leq n\leq X\right\}$ have an interesting prime distribution property. We give an exact formula for the…

Let $ \{F_n\}_{n\ge 0} $ be the sequence of Fibonacci numbers and let $p$ be a prime. For an integer $c$ we write $m_{F,p}(c)$ for the number of distinct representations of $c$ as $F_k-p^\ell$ with $k\ge 2$ and $\ell\ge 0$. We prove that…

For $k\ge1$, a $k$-almost prime is a positive integer with exactly $k$ prime factors, counted with multiplicity. In this article we give elementary proofs of precise asymptotics for the reciprocal sum of $k$-almost primes. Our results match…

As a consequence of the classification of finite simple groups, the classification of permutation groups of prime degree is complete, apart from the question of when the natural degree $(q^n-1)/(q-1)$ of ${\rm L}_n(q)$ is prime. We present…

The sequence $A067549$ of The On-Line Encyclopedia of Integer Sequences is defined as $(a_k)_{k \geq 1}$ with $a_k$ being the determinant of the $k \times k$ matrix whose diagonal contains the first $k$ prime numbers and all other elements…

A representation number is a function which expresses the number of ways an integer can be written as a sum of elements of chosen sets. One of the oldest number-theoretic results on representation numbers is Fermat's theorem which says that…

The set of prime numbers has been analyzed, based on their algebraic and arithmetical structure. Here by obtaining a sort of linear formula for the set of prime numbers, they are redefined and identified; under a systematic procedure it has…

We construct an analogue of the ring of algebraic numbers, living in a quotient of the product of all finite fields of prime order. We use this ring to deduce some results about linear recurrent sequences.

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…

New sets (typically found by computer search) with Sidon constant equal to the square root of their cardinalities are given. For each integer $N$ there are only a finite number of groups of prime order containing $N$-element extreme sets.…

Every binary De~Bruijn sequence of order n satisfies a recursion 0=x_n+x_0+g(x_{n-1}, ..., x_1). Given a function f on (n-1) bits, let N(f; r) be the number of functions generating a De Bruijn sequence of order n which are obtained by…

We explicitly describe a noteworthy transcendental continued fraction in the field of power series over Q, having irrationality measure equal to 3. This continued fraction is a generating function of a particular sequence in the set {1, 2}.…

Consider a nested, non-homogeneous recursion R(n) defined by R(n) = \sum_{i=1}^k R(n-s_i-\sum_{j=1}^{p_i} R(n-a_ij)) + nu, with c initial conditions R(1) = xi_1 > 0,R(2)=xi_2 > 0, ..., R(c)=xi_c > 0, where the parameters are integers…

Let $P(m)$ denote the largest prime factor of an integer $m\geq 2$, and put $P(0)=P(1)=1$. For an integer $k\geq 2$, let $(F_{n}^{(k)})_{n\geq 2-k}$ be the $k-$generalized Fibonacci sequence which starts with $0,...,0,1$ ($k$ terms) and…

The primorial $p\#$ of a prime $p$ is the product of all primes $q\le p$. Let pr$(n)$ denote the largest prime $p$ with $p\# \mid \phi(n)$, where $\phi$ is Euler's totient function. We show that the normal order of pr$(n)$ is $\log\log…

We explore a new sieve that generates both primes and prime factorizations, without resorting to division. We demonstrate that the integer sequences generated by the sieve are the p-adic valuations of n, and that each is a fractal sequence.…

We study generalizations of the sequence of the n-anacci constants that consist of the ratio limits generated by linear recurrences of an arbitrary order n with equal positive weights p. We derive the analytic representation of these ratio…