相关论文: A Functional Recurrence to obtain the Prime Number…

Differentiable real function reproducing primes up to a given number and having a differentiable inverse function is constructed. This inverse function is compared with the Riemann-Von Mangoldt exact expression for the number of primes not…

We present a new, elementary, dynamical proof of the prime number theorem.

We construct a smooth real-valued function P(n) in [0,1], defined via a triple integral with a periodic kernel, that approximates the characteristic function of prime numbers. The function is built to suppress when n is divisible by some m…

Simple divisibility rules are given for the 1st 1000 prime numbers.

In this paper, we state a conjecture on the prime factorization of numbers of the form $n!+1$, explore its implications, and compare it with empirical evidence and established results based on the $abc$ conjecture.

Let $b$ be an integer greater than or equal to $2$. For any integer $n\in \left[b^{\lambda-1}, b^{\lambda}-1\right]$, we denote by $R_\lambda (n)$ the reverse of $n$ in base $b$, obtained by reversing the order of the digits of $n$. We…

Using as the working hypothesis of an evaluation of the difference between primes $p_{n+1} - p_n = O(\sqrt{p_n})$ we represent in detail the proofs of Legendre's and Oppermann's conjectures.

The following work is written in easy language for college level students. It shows how the first digit probabilities of a group of continuous real-valued functions can be calculated. Thus, examples explaining how the probabilities are…

We use the Maple system to check the investigations of S. S. Gupta regarding the Smarandache consecutive and the reversed Smarandache sequences of triangular numbers [Smarandache Notions Journal, Vol. 14, 2004, pp. 366-368]. Furthermore, we…

The theorem presented in this paper allows the creation of large prime numbers (of order up to o(n^2)) given a table of all primes up to n.

We address the general mathematical problem of computing the inverse $p$-th root of a given matrix in an efficient way. A new method to construct iteration functions that allow calculating arbitrary $p$-th roots and their inverses of…

Based on new explicit estimates for the prime counting function, we improve the currently known estimates for the particular sequence $C_n = np_n - \sum_{k \leq n}p_k$, $n \geq 1$, involving the prime numbers.

We give a new procedure in Maple for finding the k-th power of a martix. The algorithm is based on the article [1].

We derive the double recurrence $e_n = \frac{1}{2}(a_{n-1}+5b_{n-1}); f_{n} = \frac{1}{2}(a_{n-1}+b_{n-1})$ with $e_0=2;f_0=0$ for the Fibonacci numbers, leading to an extremely simple and fast implementation. Though the recurrence is…

We study the arithmetic function sopfr$(n)$ (OEIS A001414) which gives the sum of prime factors (with repetition) of a number $n$. In particular we obtain the asymptotic formula $$ \sum_{n \leq x} \rm{sopfr}(n) \sim \frac{\pi^2}{12}…

We consider the sum of squares function in the ring $\mathbb{Z}_{n}$. We determine formulae in a number of cases when $n$ is a power of a prime.

We prove several results regarding the distribution of numbers that are the product of a prime and a $k$-th power. First, we prove an asymptotic formula for the counting function of such numbers; this generalises a result of E. Cohen. We…

In this paper we obtained several properties that the characteristic polynomials of the unit-primitive matrix satisfy. In addition, using these properties we have shown that the recurrence relation given as in the formula (1) is true. In…

In this article we present a simple proof of Borevich-Shafarevich's method to compute the sum of the first n natural numbers of the same power. We also prove several properties of Bernoulli's numbers.

Using the simple properties of Riemman integrable functions, Ramanujan's formula for sum of the square roots of first n natural numbers has been generalized to include r'th roots where r is any real number greater than 1.As an application…