Related papers: A characterization of Wilson-Lerch primes
A classification of twin primes implies special twin primes. When applied to triplets, it yields exceptional prime number triplets. These generalize yielding exceptional prime number multiplets.
In a field of Laurent series, we construct a subring which has a module structure over a Weyl algebra. Identities of Bernoulli numbers and polynomials are obtained from these algebraic structures.
This work is meant to demonstrate new class of prime numbers -- cyclic prime numbers, that can be derived from any prime number at certain numeric systems. Cyclic prime numbers are also related to the cyclic numbers and full reptend prime…
Statistical distribution of the primes in an arithmetic progression is considered. The estimation of prime numbers is given and combinatorial methods are used to calculate the twin primes on the available interval. The distribution and…
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…
We give a new sufficient condition which allows to test primality of Fermat's numbers. This characterization uses uniquely values at most equal to tested Fermat number. The robustness of this result is due to a strict use of elementary…
Let \beta be a real number. Then for almost all irrational \alpha>0 (in the sense of Lebesgue measure) \limsup_{x\to\infty}\pi_{\alpha,\beta}^*(x)(\log x)^2/x>=1, where \pi_{\alpha,\beta}^*(x)={p<=x: both p and [\alpha p+\beta] are primes}.
In this paper we study a sequence involving the prime numbers by deriving two asymptotic formulas and finding new upper and lower bounds, which improve the currently known estimates.
Let $n,k\in\mathbb{N}$ and let $p_{n}$ denote the $n$th prime number. We define $p_{n}^{(k)}$ recursively as $p_{n}^{(1)}:=p_{n}$ and $p_{n}^{(k)}=p_{p_{n}^{(k-1)}}$, that is, $p_{n}^{(k)}$ is the $p_{n}^{(k-1)}$th prime. In this note we…
The Baillie-PSW primality test combines Fermat and Lucas probable prime tests. It reports that a number is either composite or probably prime. No odd composite integer has been reported to pass this combination of primality tests if the…
In the first part of this expository paper, we present and discuss the interplay of Dirichlet polynomials in some classical problems of number theory, notably the Lindel\"of Hypothesis. We review some typical properties of their means and…
In this note we show that any proof of Wallis's formula or of the probability integral formula proves both assertions.
We introduce and study a `level two' generalization of the poly-Bernoulli numbers, which may also be regarded as a generalization of the cosecant numbers. We prove a recurrence relation, two exact formulas, and a duality relation for…
The aim of this paper is to find the numerical solutions of the second order linear and nonlinear differential equations with Dirichlet, Neumann and Robin boundary conditions. We use the Bernoulli polynomials as linear combination to the…
We generalize techniques of Addison to a vastly larger context. We obtain integral representations in terms of the first periodic Bernoulli polynomial for a number of important special functions including the Lerch zeta, polylogarithm,…
The purpose of this paper is to derive some identities of the higher order generalized twisted Bernoulli numbers and polynomials attached to $\chi$ from the properties of the p-adic invariant integrals.
An s-tuple of positive integers are k-wise relatively prime if any k of them are relatively prime. Exact formula is obtained for the probability that s positive integers are k-wise relatively prime.
In this chapter we characterize Askey-Wilson polynomials including specific and limiting cases of them by some structure relations of the first type.
We give a new identity involving Bernoulli polynomials and combinatorial numbers. This provides, in particular, a Faulhaber-like formula for sums of the form $1^m (n-1)^m + 2^m (n-2)^m + \cdots + (n-1)^m 1^m$ for positive integers $m$ and…
Various new identities, recurrence relations, integral representations, connection and explicit formulas are established for the Bernoulli, Euler numbers and the values of Riemann's zeta function. To do this, we explore properties of some…