相关论文: A Functional Recurrence to obtain the Prime Number…
Using elementary methods we find surprising connections between the values of the Riemann Zeta Function over integers and the fractional parts of rational powers, and a connection between the Riemann Zeta Function and the Prime Zeta…
Exact summatory functions that count the number of prime $k$-tuples up to some cut-off integer are presented. Related summatory $k$-tuple analogs of the first and second Chebyshev functions are then defined. Using a gamma distribution…
Let $\{u_{n}\}_{n \geq 0}$ be a non-degenerate binary recurrence sequence with positive, square-free discriminant and $p$ be a fixed prime number. In this paper, we have shown the finiteness result for the solutions of the Diophantine…
In this paper we provided a formula for the $n$th term of the $k$-generalized Fibonacci-like sequence, a generalization of the well-known Fibonacci sequence, having $k$ arbitrary initial terms, where the succeeding terms are obtained by…
In this paper, we find a new recurrence formula fo the Euler zeta functions.
From known effective bounds on the prime counting function of the form \[ |\pi(x)-\mathrm{Li}(x)| < a \;x \;(\ln x)^{b} \; \exp\left(-{c}\; \sqrt{\ln x}\right); \qquad (x \geq x_0); \] it is possible to establish exponentially tight…
The number of parts in the partitions (resp. distinct partitions) of $n$ with parts from a set were considered. Its generating functions were obtained. Consequently, we derive several recurrence identities for the following functions: the…
The chronicle of prime numbers travel back thousands of years in human history. Not only the traits of prime numbers have surprised people, but also all those endeavors made for ages to find a pattern in the appearance of prime numbers has…
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…
For every sufficiently large integer $R$, there exists a Carmichael number with exactly $R$ prime factors.
Prime numbers are fascinating by the way they appear in the set of natural numbers. Despite several results enlighting us about their repartition, the set of prime numbers is often informally qualified as misterious. In the present paper,…
We present some Euler-type recurrences for the partition function $p(n)$.
We give the q-analogue of the sums of the n-th powers of positive integers up to k-1.
We introduce $p$-derivations and give a few basic ways in which they act like derivatives by numbers.
We introduce the concept of an almost prime number generalizing a prime number. It turns out that a composite almost prime number must be a Carmichael number, in case it exists. We prove several properties of almost prime numbers and…
In this article, we develop four types of analytical recurrence formulas for non-trivial zeros of the Riemann zeta function on critical line assuming (RH). Thus, all non-trivial zeros up to the $n$th order must be known in order to generate…
In this paper, we first find the distribution of nth power residues modulo a prime $p$ by analyzing sums involving Dirichlet characters. We then extend this method to characterize the distribution of powers in arbitrary finite fields.
In this paper, for a positive integer $n\ge 1$, we look at the size and prime factors of the iterates of the Ramanujan $\tau$ function applied to $n$.
In this work I look at the distribution of primes by calculation of an infinite number of intersections. For this I use the set of all numbers which are not elements of a certain times table in each case. I am able to show that it exists a…
The results for the fractional sequence $\left \{[x/n]+1:n \leq x\right \}$, and the fractional sequence in arithmetic progression $\left \{q[x/n]+a:n \leq x\right \}$, where $a<q$ are integers such that $\gcd(a,q)=1$, prove that these…