Related papers: Special Sets of Primes in Function Fields

Let $P(x) \in \mathbb{Z}[x]$ be a polynomial. We give an easy and new proof of the fact that the set of primes $p$ such that $p \mid P(n)$, for some $n \in \mathbb{Z}$, is infinite. We also get analog of this result for some special…

A classical problem in analytic number theory is to study the distribution of $\alpha p$ modulo 1, where $\alpha$ is irrational and $p$ runs over the set of primes. We consider the subsequence generated by the primes $p$ such that $p+2$ is…

In this paper, we first find the distribution of nth power residues modulo a prime $p$ by analyzing sums involving Dirichlet characters. We then extend this method to characterize the distribution of powers in arbitrary finite fields.

We consider the problem of determining whether a set of primes, or, more generally, prime ideals in a number field, can be realized as a finite union of residue classes, or of Frobenius conjugacy classes. We give criteria for a set to be…

Fix $a \in \mathbb{Z}$, $a\notin \{0,\pm 1\}$. A simple argument shows that for each $\epsilon > 0$, and almost all (asymptotically 100% of) primes $p$, the multiplicative order of $a$ modulo $p$ exceeds $p^{\frac12-\epsilon}$. It is an…

A composite number $n$ is called a Lehmer number when $\phi(n) | n - 1$, where $\phi$ is the Euler totient function. Lehmer's totient problem asks if there exist any composite numbers $n$ such that $\phi(n)| n-1$? No such numbers are known.…

Euler's totient function counts the positive integers up to a given integer n that are relatively prime to n. The aim of this article is to give a result about the sum of euler's totient function from k equal 1 to n whene p divides n and p…

Let $F_p$ be the field of a prime order $p$. Then for any positive integer $n>1$, for any $\epsilon>0$, and for any subset $A$ of $F_p$, every element of $F_p$ can be represented as a sum of $N$ elements, each of them is a product of $n$…

This research presents the results of a study on the existence and frequency distribution of the shell primes defined herein as prime numbers that result from the calculation of the "half-shell" of an p-dimensional entity of the form…

For every prime $p$, we construct an infinite countable group that contains precisely $p-1$ elements which are not $p$th powers.

We show that there exist infinite sets $A = \{a_1,a_2,\dots\}$ and $B = \{b_1,b_2,\dots\}$ of natural numbers such that $a_i+b_j$ is prime whenever $1 \leq i < j$.

The Euler's totient function $ \varphi(n) $ counts the positive integers up to a given integer $ n$ that are relatively prime to $ n $. We solve a problem due to Lehmer that there is no composite number $ n $ such that $ \varphi(n)\mid n-1…

Let $ x\geq 1 $ be a large number, let $ [x]=x-\{x\} $ be the largest integer function, and let $ \varphi(n)$ be the Euler totient function. The asymptotic formula for the new finite sum over the primes $ \sum_{p\leq…

Let m>2 be an integer. We show that ZF + "For every integer n, Every countable family of non-empty sets of cardinality at most n has an infinite partial choice function" is not strong enough to prove that every countable set of m-element…

In this short paper we present an elementary proof of the infinitude of primes. Our proof is similar in spirit to Euler's proof that the reciprocals of primes diverges and only uses tools from elementary number theory and calculus. In…

Let $x$ be a positive integer. We give an asymptotic formula for the number of primes in the set $\{\fl{x/n}, 1 \le n \le x\}$ and give some related results.

We consider the distribution in residue classes modulo primes $p$ of Euler's totient function $\phi(n)$ and the sum-of-proper-divisors function $s(n):=\sigma(n)-n$. We prove that the values $\phi(n)$, for $n\le x$, that are coprime to $p$…

For every prime number p, we show the existence of a solvable number field L ramified only at {p and infinity whose p-Hilbert Class field tower is infinite.

There exists an absolute constant $C$ with the following property. Let $A \subseteq \mathbb{F}_p$ be a set in the prime order finite field with $p$ elements. Suppose that $|A| > C p^{5/8}$. The set \[ (A \pm A)(A \pm A) = \{(a_1 \pm…

In this work we show that the prime distribution is deterministic. Indeed the set of prime numbers P can be expressed in terms of two subsets of N using three specific selection rules, acting on two sets of prime candidates. The prime…