Related papers: All Prime Numbers Have Primitive Roots

Let n be a positive odd integer and let p>n+1 be a prime. We mainly derive the following congruence: $$\sum_{0<i_1<...<i_n<p}(i_1/3)(-1)^{i_1}/(i_1...i_n)=0 (mod p).$$

We prove an isomorphism between the finite domain from 1 up to the product of the first n primes and the new defined set of prime modular numbers. This definition provides some insights about relative prime numbers. We provide an inverse…

Every finite group whose order is divisible by a prime $p$ has at least $2 \sqrt{p-1}$ conjugacy classes.

For a class of Lucas sequences ${x_n}$, we show that if $n$ is a positive integer then $x_n$ has a primitive prime factor which divides $x_n$ to an odd power, except perhaps when $n = 1, 2, 3 or 6$. This has several desirable consequences.

Let $n$ be a primitive non-deficient number where $n=p_1^{a_1}p_2^{a_2} \cdots p_k^{a_k}$ where $p_1, p_2 \cdots p_k$ are distinct primes. We prove that there exists an $i$ such that $$p_i^{a_i+1} < 2k(p_1p_2p_3\cdots p_k).$$ We conjecture…

Let $n, k$ and $a$ be positive integers. The Stirling numbers of the first kind, denoted by $s(n,k)$, count the number of permutations of $n$ elements with $k$ disjoint cycles. Let $p$ be a prime. In recent years, Lengyel, Komatsu and…

We obtain a simple relations for the Newman sum over multiples of a prime with a primitive or semiprimitive root 2. We consider the case of p=17 as well.

Given a prime number \(p\) and a natural number \(m\) not divided by \(p\), we propose the problem of finding the smallest number \(r_{0}\) such that for \(r\geq r_{0}\), every group \(G\) of order \(p^{r}m\) has a non-trivial normal…

A study of certain Hamiltonian systems has lead Y. Long to conjecture the existence of infinitely many primes of the form $p=2[\alpha n]+1$, where $1<\alpha<2$ is a fixed irrational number. An argument of P. Ribenboim coupled with classical…

We call an integer N>1 primover to base a if it either prime or overpseudoprime to base a. We prove, in particular, that every Fermat number is primover to base 2. We also indicate a simple process of receiving of primover divisors of…

The classification of abelian groups of central type is well known. However, the description of non-abelian groups of central type which are known to be solvable, is far from being understood. In this paper we classify all groups of central…

While the prime numbers have been subject to mathematical inquiry since the ancient Greeks, the accumulated effort of understanding these numbers has - as Marcus du Sautoy recently phrased it - 'not revealed the origins of what makes the…

In the algebraic theory of codes and formal languages, the set $Q$ of all primitive words over some alphabet $\zi $ has received special interest. With this survey article we give an overview about relevant research to this topic during the…

Fix an integer $g \neq -1$ that is not a perfect square. In 1927, Artin conjectured that there are infinitely many primes for which $g$ is a primitive root. Forty years later, Hooley showed that Artin's conjecture follows from the…

Let $p_{1}<p_2<... <p_{\nu}<...$ be the sequence of prime numbers and let $m$ be a positive integer. We give a strong asymptotic formula for the distribution of the set of integers having prime factorizations of the form…

This note generalizes the Fibonacci primitive roots to the set of integers. An asymptotic formula for counting the number of integers with such primitive root is introduced here.

We investigate, using the weighted linear sieve, the distribution of almost-primes among the residue classes (mod p) that generate the multiplicative group of reduced residue classes. We are concerned with finding an upper bound for the…

Prime numbers have attracted the attention of mathematiciansand enthusiasts for millenniums due to their simple definition and remarkable properties. In this paper, we study primorial numbers (the product of the first prime numbers) to…

Recently, I have defined the so called PDF's (prime distribution factors) which govern the distribution of prime numbers of the type $p,p+a_i$ being all primes up to some number $n$. It was shown that the PDF's are expressible in terms of…

Let $(b_n) = (b_1, b_2, ...)$ be a sequence of integers. A primitive prime divisor of a term $b_k$ is a prime which divides $b_k$ but does not divide any of the previous terms of the sequence. A zero orbit of a polynomial $f(z)$ is a…