Related papers: A superpowered Euclidean prime generator

Euler presents a third proof of the Fermat theorem, the one that lets us call it the Euler-Fermat theorem. This seems to be the proof that Euler likes best. He also proves that the smallest power x^n that, when divided by a numer N, prime…

Let $\omega(n)$ denote the number of distinct prime factors of $n$. Then for any given $K\geq 2$, small $\epsilon>0$ and sufficiently large (only depending on $K$ and $\epsilon$) $x$, there exist at least $x^{1-\epsilon}$ integers…

The discrete Fourier transform of the greatest common divisor is a multiplicative function, if taken with respect to the same order of the primitive root of unity, which is a well known fact. As such, the transform can be expressed in the…

Let $1<c<d$ be two relatively prime integers, $g_{c,d}=cd-c-d$ and $\mathbb{P}$ is the set of primes. For any given integer $k \geq 1$, we prove that $$\#\left\{p^k\le g_{c,d}:p\in \mathbb{P}, ~p^k=cx+dy,~x,y\in \mathbb{Z}_{\geqslant0}…

In 2000 Deaconescu raised a question whether there exists a composite $n$ for which $S_2(n)|\phi(n)-1$, where $\phi(n)$ is Euler's function and $S_2(n)$ is Schemmel's totient function. In this paper we prove that any such $n$ is odd,…

Given an integer $n \ge 3$, let $u_1, \ldots, u_n$ be pairwise coprime integers $\ge 2$, $\mathcal D$ a family of nonempty proper subsets of $\{1, \ldots, n\}$ with "enough" elements, and $\varepsilon$ a function $ \mathcal D \to \{\pm…

We give a bijective proof of the fact that the number of k-prefixes of minimal factorisations of the n-cycle (1...n) as a product of n-1 transpositions is n^{k-1}\binom{n}{k+1}. Rather than a bijection, we construct a surjection with fibres…

Let $p$ be a prime and let $g(p)$ be the least primitive root modulo $p$. We prove that for any $\epsilon>0$ and $p$ large enough the bound \begin{align} g(p)\ll p^{\frac{1}{4\sqrt{e}}+\epsilon} \nonumber \end{align} holds for most prime…

We have constructed a Carmichael number with 10,333,229,505 prime factors, and have also constructed Carmichael numbers with k prime factors for every k between 3 and 19,565,220. These computations are the product of implementations of two…

Let $p_1=2, p_2=3, p_3=5, \ldots$ be the consecutive prime numbers, $S_n$ the numerical semigroup generated by the primes not less than $p_n$ and $u_n$ the largest irredundant generator of $S_n$. We will show, that $\bullet$ $u_n\sim3p_n$.…

This paper presents a new technique of generating large prime numbers using a smaller one by employing Goldbach partitions. Experiments are presented showing how this method produces candidate prime numbers that are subsequently tested…

Let $p$ be a prime and $p_1,\ldots, p_r$ be distinct prime divisors of $p-1$. We prove that the smallest positive integer $n$ which is a simultaneous $p_1,\ldots,p_r$-power nonresidue modulo $p$ satisfies $$ n<p^{1/4 -…

This paper examines in a new way some known facts about numerical semigroups especially when the number of minimal generators (that is the embedding dimension) is at most three and at least two minimal generators are coprime. For such…

Generalising a previous result, we determine all non-abelian finite simple groups whose order has largest prime divisor not exceeding $10^4$. The computer code for this and similar calculations is made available.

The second generalized GK function fields $K_n$ are a recently found family of maximal function fields over the finite field with $q^{2n}$ elements, where $q$ is a prime power and $n \ge 1$ an odd integer. In this paper we construct many…

Let $\vfi$ be Euler's function, $\ga$ be Euler's constant and $N_k$ be the product of the first $k$ primes. In this article, we consider the function $c(n) =(n/\vfi(n)-e^\ga\log\log n)\sqrt{\log n}$. Under Riemann's hypothesis, it is proved…

Let $k\geq2$ and $s$ be positive integers. Let $\theta\in(0,1)$ be a real number. In this paper, we establish that if $s>k(k+1)$ and $\theta>0.55$, then every sufficiently large natural number $n$, subjects to certain congruence conditions,…

Let $q_n$ denote the $n^{th}$ number that is a product of exactly two distinct primes. We prove that $$\liminf_{n\to \infty} (q_{n+1}-q_n) \le 6.$$ This sharpens an earlier result of the authors (arXivMath NT/0506067), which had 26 in place…

Let D(n) be the set of all fractions in the unit interval whose denominator in lowest terms equals $n$. We evaluate the product of the values of the Gamma function at the points of D(n), as a function of $n$; the answer depends on whether…

Let $p_k(n)$ be given by the $k$-th power of the Euler Product $\prod _{n=1}^{\infty}(1-q^n)^k=\sum_{n=0}^{\infty}p_k(n)q^{n}$. By investigating the properties of the modular equations of the second and the third order under the Atkin…