相关论文: Strong pseudoprimes to the first 9 prime bases

We improve the unconditional explicit bounds for the error term in the prime counting function $\psi(x)$. In particular, we prove that, for all $x>2$, we have \[ \left| \psi(x)-x \right| < 9.22106 \, x \, (\log x)^{3/2}…

In this paper we present some observations about the well-known Goldbach conjecture. In particular we list and interpret some numerical results which allow us to formulate a relation between prime numbers and even integers. We can also…

We introduce extremely symmetric primes and provide some elementary properties of these.

We develop conjectures and theorems expressing the idea that the prime sequence exhibits computational irreducibility in the transition from one prime to its successor. Informally, given a prime pp p, no general algorithm can compute the…

Using a sieve-theoretic argument, we show that almost all gaps $(p_n, p_{n+1})$ between consecutive primes $p_n, p_{n+1}$ contain a natural number $m$ whose least prime factor $p(m)$ is at least the length $p_{n+1} - p_n$ of the gap,…

Let $f=a_0+ a_{1}x+\cdots+a_m x^m\in \Bbb{Z}[x]$ be a primitive polynomial. Suppose that there exists a positive real number $\alpha$ such that $|a_m| \alpha^m>|a_0|+|a_1|\alpha+\cdots+|a_{m-1}|\alpha^{m-1}$. We prove that if there exist…

A number $n$ is said to be economical if the prime power factorisation of $n$ can be written with no more digits than $n$ itself. We show that under a plausible hypothesis, related to the twin prime conjecture, there are arbitrarily long…

What is the first prime? It seems that the number two should be the obvious answer, and today it is, but it was not always so. There were times when and mathematicians for whom the numbers one and three were acceptable answers. To find the…

Let $q\ge 3$ be a non-exceptional modulus $q\ge3$, and let $a$ be a positive integer coprime with $q$. For any $\epsilon>0$, there exists $\alpha>0$ (computable), such that for all $x\ge \alpha (\log q)^2$, the interval $\left[…

Cohen, Lewin and Zagier found four ladders that entail the polylogarithms ${\rm Li}_n(\alpha_1^{-k}):=\sum_{r>0}\alpha_1^{-k r}/r^n$ at order $n=16$, with indices $k\le360$, and $\alpha_1$ being the smallest known Salem number, i.e. the…

A sequence $\pi_1,\pi_2,\dots$ of permutations is said to be "quasirandom" if the induced density of every permutation $\sigma$ in $\pi_n$ converges to $1/|\sigma|!$ as $n\to\infty$. We prove that $\pi_1,\pi_2,\dots$ is quasirandom if and…

A Friedman number is a positive integer which is the result of an expression combining all of its own digits by use of the four basic operations, exponentiation and digit concatenation. A "nice" Friedman number is a Friedman number for…

We give an algorithm to enumerate all primitive abundant numbers (briefly, PANs) with a fixed $\Omega$ (the number of prime factors counted with their multiplicity), and explicitly find all PANs up to $\Omega=6$, count all PANs and…

For a positive integer $n$, we denote by $F(n)$ the distance from $n$ to the nearest prime number. We prove that every sufficiently large positive integer $N$ can be represented as the sum $N=n_1+n_2$, where $$ F(n_i) \geqslant (\log…

Let $\mathcal{P}_s(n)$ denote the $n$th $s$-gonal number. We consider the equation \[\mathcal{P}_s(n) = y^m, \] for integers $n,s,y,$ and $m$. All solutions to this equation are known for $m>2$ and $s \in \{3,5,6,8,20 \}$. We consider the…

We explore two questions about pseudo-polynomials, which are functions $f:\mathbb N \to \mathbb Z$ such that $k$ divides $f(n+k) - f(n)$ for all $n,k$. First, for certain arbitrarily sparse sets $R$, we construct pseudo-polynomials $f$ with…

Around the year 2007, one of the authors, Tsai, accidentally discovered a property of the number $198$ he saw on the license plate of a car. Namely, if we take $198$ and its reversal $891$, which have prime factorizations $198 = 2\cdot…

This article is about Pi Formulas, infinite series of fractions which sum to multiples of Pi. Each such one can be associated with a unique set $S_k$ of rough numbers, where $k$ is a prime number. Given $S_k$ for any prime $k$, the set…

Observations of the cosmic 21-cm power spectrum (PS) are starting to enable precision Bayesian inference of galaxy properties and physical cosmology, during the first billion years of our Universe. Here we investigate the impact of common…

It is proven that, in any given base, there are infinitely many palindromic numbers having at most six prime divisors, each relatively large. The work involves equidistribution estimates for the palindromes in residue classes to large…