Related papers: Constructing the Primitive Roots of Prime Powers

Expressions of type $(p^q-1)/(p-1)$ and $a^2+ab+b^2$, where $a, b$ are natural and $p, q$ are prime numbers, are studied.

Mathematicians has been trying to prove the weak Goldbach's conjecture by adding prime numbers, as stated in the conjecture. However, we believe that the solution does not need to be analytically solved. Instead of trying to add prime…

Given a prime $p$, we construct a permutation group containing at least $p^{p-2}$ non-conjugated regular elementary abelian subgroups of order $p^3$. This gives the first example of a permutation group with exponentially many non-conjugated…

Let $p$ be a large odd prime, let $x=\log p)(\log\log p)^{3+\varepsilon}$ and let $q\ll\log\log p$ be an integer, where $\varepsilon>0$ is a small number. This note proves the existence of small prime quadratic residues and small prime…

We show that if $k$ is a countable field, then there exists a finitely generated, infinite-dimensional, primitive algebraic $k$-algebra $A$ whose Gelfand-Kirillov dimension is at most six. In addition to this we construct a two-generated…

In the present paper we prove that there exist infinitely many arithmetic progressions of three different primes $p_1,p_2,p_3=2p_2-p_1$ such that $p_1=x_1^2 + y_1^2 +1$, $p_2=x_2^2 + y_2^2 +1$.

Let $\mathcal{A}'$ be the set of integers missing any three fixed digits from their decimal expansion. We produce primes in a thin sequence by proving an asymptotic formula for counting primes of the form $p = m^2 + \ell^2$, with $\ell \in…

Let $q\ne \pm1,v^2$ be a fixed integer, and let $x\geq 1$ be a large number. The least prime number $p \geq3 $ such that $q$ is a primitive root modulo $p$ is conjectured to be $p\ll (\log q)(\log \log q)^3),$ where $\gcd(p,q)=1$. This note…

The roots of any polynomial of degree m with complex integer coefficients can be computed by manipulation of sequences made from distinct symbols and counting the different symbols in the sequences. This method requires only primitive…

For finite-dimensional Hopf algebras, their classification in characteristic $0$ (e.g. over $\mathbb{C}$) has been investigated for decades with many fruitful results, but their structures in positive characteristic have remained elusive.…

We present a deterministic algorithm that, given a prime $p$ and a solution $x \in \mathbb Z$ to the discrete logarithm problem $a^x \equiv b \pmod p$ with $p\nmid a$, efficiently lifts it to a solution modulo $p^k$, i.e., $a^x \equiv b…

Let a and f be coprime positive integers. Let g be an integer. Under the Generalized Riemann Hypothesis (GRH) it follows by a result of H.W. Lenstra that the set of primes p such that p=a(mod f) and g is a primitive root modulo p has a…

Suppose $k,p\!\in\!\mathbb{N}$ with $p$ prime and $f\!\in\!\mathbb{Z}[x]$ is a univariate polynomial with degree $d$ and all coefficients having absolute value less than $p^k$. We give a Las Vegas randomized algorithm that computes the…

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.

Each natural number can be associated with some tree graph. Namely, a natural number $n$ can be factorized as $$ n = p_1^{\alpha_1}\ldots p_k^{\alpha_k},$$ where $p_i$ are distinct prime numbers. Since $\alpha_i$ are naturals, they can be…

Let $A$ be a finite set of integers. We show that if $k$ is a prime power or a product of two distinct primes then $$|A+k\cdot A|\geq(k+1)|A|-\lceil k(k+2)/4\rceil$$ provided $|A|\geq (k-1)^{2}k!$, where $A+k\cdot A=\{a+kb:\ a,b\in A\}$. We…

Suppose $ m,n\geq 2 $ are co prime integers. We prove certain new symmetries of the base $ n $ representation of $ 1/m $, and in particular characterize the subgroup generated by $ n $ inside $ (\mathbb{Z}/m\mathbb{Z})^\times $. As an…

Let a,f and g be integers, with a and f coprime. Under the generalized Riemann hypothesis it follows from work of Hooley and Lenstra that the set of primes p such that p=a(mod f) and g is primitive root mod p has a natural density. In this…

We present a simple, closed formula which gives all the primes in order. It is a simple product of integer floor and ceiling functions.

Let $p$ be an odd prime. In this paper we investigate quadratic residues modulo $p$ and related permutations, congruences and identities. If $a_1<\ldots<a_{(p-1)/2}$ are all the quadratic residues modulo $p$ among $1,\ldots,p-1$, then the…