相关论文: The Carmichael numbers up to $10^{17}$

Multiple analogues of certain families of combinatorial numbers are recently constructed by the author in terms of well poised Macdonald functions, and some of their fundamental properties are developed. In this paper, we present…

Consider exponential Carmichael function $\lambda^{(e)}$ such that $\lambda^{(e)}$ is multiplicative and $\lambda^{(e)}(p^a) = \lambda(a)$, where $\lambda$ is usual Carmichael function. We discuss the value of $\sum \lambda^{(e)}(n)$, where…

In this work we show that the prime distribution is deterministic. Indeed the set of prime numbers P can be expressed in terms of two subsets of N using three specific selection rules, acting on two sets of prime candidates. The prime…

We introduce new refinements of the Bell, factorial, and unsigned Stirling numbers of the first and second kind that unite the derangement, involution, associated factorial, associated Bell, incomplete Stirling, restricted factorial,…

Bertrand's postulate establishes that for all positive integers $n>1$ there exists a prime number between $n$ and $2n$. We consider a generalization of this theorem as: for integers $n\geq k\geq 2$ is there a prime number between $kn$ and…

Multiple harmonic-like numbers are studied using the generating function approach. A closed form is stated for binomial sums involving these numbers and two additional parameters. Several corollaries and examples are presented which are…

We survey the classical results on the prime number theorem

The purpose of this note is to report on the discovery of the primes of the form $p=1+n!\sum n$, for some natural numbers $n>0$. The number of digits in the prime p are approximately equal to $\lfloor log_{10}(1+n!\sum n)\rceil+1$.

Assuming the Riemann hypothesis, we prove the latest explicit version of the prime number theorem for short intervals. Using this result, and assuming the generalised Riemann hypothesis for Dirichlet $L$-functions is true, we then establish…

This is a survey of a connection between the distribution of certain power residues modulo $p$, $p$ a prime, and relative class numbers. The focus lies on quadratic residues and sixth power residues. Dirichlet's class number formula yields…

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…

In this article, we present a method to construct $e$-power $b$-happy numbers of any height. Using this method, we construct a tree that encodes these happy numbers, their heights, and their ancestry--relation to other happy numbers. For…

Recently, degenerate Cauchy numbers and polynomials are introduced in [10]. In this paper, we study the degenerate Cauchy numbers and polynomials which are different from the previous degenerate Cauchy numbers and polynomials. In addition,…

Currently there is no known efficient formula for primes. Besides that, prime numbers have great importance in e.g., information technology such as public-key cryptography, and their position and possible or impossible functional generation…

We give an estimation of the existence density for the $2d$ different primes by using a new and simple algorithm for getting the $2d$ different primes. The algorithm is a kind of the sieve method, but the remainders are the central numbers…

The main purpose of this paper is to construct new families of special numbers with their generating functions. These numbers are related to the many well-known numbers, which are the Bernoulli numbers, the Fibonacci numbers, the Lucas…

In recent work by Botkin, Dawsey, Hemmer, Just and the present author, a deterministic model of prime number distribution is developed based on properties of integer partitions that gives almost exact estimates for $\pi(n)$, the number of…

We report a rigorous theory to show the origin of the unexpected periodic behavior seen in the consecutive differences between prime numbers. We also check numerically our findings to ensure that they hold for finite sequences of primes,…

A permutiple is the product of a digit preserving multiplication, that is, a number which is an integer multiple of some permutation of its digits. Certain permutiple problems, particularly transposable, cyclic, and, more recently,…

It is well known that permutations avoiding any 3-length pattern are enumerated by the Catalan numbers. If the three patterns 123, 132 and 213 are avoided at the same time we obtain a class of permutations enumerated by the Fibonacci…