Prime numbers are natural numbers greater than 1 not divisible by any smaller number other than 1. This tag is intended for questions about, related to, or involving prime numbers.

learn more… | top users | synonyms

2
votes
2answers
59 views

In $\mathbb{Z}_q$ where $q$ is prime, show that $[a^q]=[a]$ for all $[a]\in \mathbb{Z}_q$

Question: In $\mathbb{Z}_q$ where $q$ is prime, show that $a^q=a$ for all $a\in \mathbb{Z}_q$. My attempt: To show $[a^q]=[a]$ for all $[a]\in \mathbb{Z}_q$, it suffices to show that for any $a\in\...
1
vote
1answer
73 views

Consecutive prime numbers

Let's assume k and n are consecutive prime numbers, $k \lt n$. An axiom: for any such $k$ and $n$, $k^2 \gt n$. This seems 'obviously' true to me, but could you please prove me wrong? Or if it's ...
1
vote
1answer
58 views

A question about the product of primes

Let $\mathbb{P}$ be the set of all primes in the natural numbers and let $p_i \in \mathbb{P}$ be the $i$th prime, $p_1=2$. Let $m = \prod_{i=1}^n (p_i)$. How many solutions does $x^2 + x \equiv 0 (\...
0
votes
1answer
71 views

A question on the prime number theorem as presented in the following paper

In the section 2. of this paper it is written that, ...The prime number theorem ensures that we can choose $B$ as close to $1$ as we want, provided $x_0$ is sufficiently large. I think that ...
2
votes
1answer
65 views

Irrationality of the concatenation of decimal expansions of primes

I've heard the proof that this number is irrational is accessible to even a novice to number theory: $\alpha = 0.2 \ 3 \ 5 \ 7 \ 11 \ 13 \ 17 \ldots$ The proof may utilize that a number is ...
2
votes
1answer
71 views

Periodicity over the prime indices of a multiplicative sequence implies periodicity?

I have a real sequence $(a_p)$ indexed by the prime numbers which takes values -1, 0, or 1, having the property that $a_p=a_q$ whenever $p\equiv q \pmod m$, where $m$ is a fixed integer $>2$. I'm ...
14
votes
2answers
438 views

A conjecture concerning primes and algebra

A monoid morphism $\psi:\mathbb Z_+\!\!\rightarrow\mathbb Z_+$ is defined by an arbitrary function $f:\mathbb Z_+\!\!\rightarrow\mathbb Z_+$ and defines a group homomorphism $\varphi:\mathbb Q_+\!\!\...
1
vote
1answer
35 views

Easy (?) estimation about prime powers

Let $N_k$ be some integers with $\sum_{k\mid n}kN_k=p^n$. How can I prove $$\frac{p^n}{n}-\frac{2p^{n/2}}{n}\leq N_n?$$
6
votes
1answer
119 views

How many numbers are products of $p^p$?

Consider the set $\mathcal{S}=\{1,4,16,27,\ldots\}$ of numbers which are products of numbers of the form $p^p$ for $p$ prime. ($\mathcal{S}$ is A072873 in the OEIS.) Note that multiple primes are ...
1
vote
1answer
61 views

To prove $\pi(x)>\dfrac x{\ln x} , \forall x \ge 17$ by elementary argument

Is there an elementary argument for proving $$\forall x \ge 17:\pi(x)>\dfrac x{\ln x} $$ ? where $\pi(x)$ is the prime counting function ....
9
votes
0answers
142 views

Primality of $n! +1$

I came across with a problem where I was required to examine primality of $n! +1$ (17! + 1 was the actual number). Although Wilson's Theorem could be manipulated for determining primality of $n! + 1$...
0
votes
1answer
15 views

finding A using with restriction $1 \leq a \leq 20$ in GCD

For what $1 \leq a \leq 20$ you are finding $a$ is it true that $a^m+a^n=x^2$ for positive integers $a,m,n,x.$ I did $a^m+a^n=x^2.$ $=a^m(a^{n-m}+1)=x^2$ We know that since $(a,b)=1$ since the ...
2
votes
1answer
127 views

Primality Criterion for Specific Class of Proth Numbers

Is this proof acceptable ? Theorem : Let $N = k\cdot 2^n+1$ with $n>1$ , $k<2^n$ , $3 \mid k $ , and $\begin{cases} k \equiv 3 \pmod {30} , & \text{with }n \equiv 1,2 \pmod 4 \\ k \...
0
votes
1answer
66 views

Asymptotic Expression for the Twin Prime Counting Function

A variation on a previous question I asked, which has garnered no responses. I'll attempt to be more lucid: Let $\pi_2(x)$ be the twin prime counting function and $\pi(x)$ be the prime counting ...
0
votes
0answers
56 views

How can one find a million of consecutive prime numbers greater than 1 trillion? [duplicate]

I am looking for bigger prime numbers than 1 trillion. At least a million consecutive ones. Where or how can I find some?
2
votes
2answers
98 views

A Generalization of Carmichael Numbers

Obviously, from Fermat's Little Theorem, the condition of $p$ being prime is equivalent to there being some number $a$ of multiplicative order $p-1$ mod $p$. Moreover, this is equivalent to saying ...
0
votes
2answers
22 views

Proof for divisions that in include prime number. [duplicate]

How do I prove, that if $m^2$ can be divided $p$ (where $m$ is a whole number and $p$ is a prime number) then also m can be divided by $p$?
15
votes
7answers
3k views
3
votes
5answers
3k views

If $p$ and $q$ are prime numbers larger than $2$, then $pq + 1 $ is never prime

I am trying to prove the following: If $p$ and $q$ are prime numbers larger than $2$, then $pq + 1 $ is never prime. Any ideas?
2
votes
2answers
146 views

Prove or disprive that $n^{2}-n+17$ is prime for all integers $n$

I am looking to prove this function is always prime for all integers $n$: $$n^{2}-n+17$$ I have tested it for the first $10$ integers and it seems to work but I am not sure how to prove it form all $n$...
0
votes
1answer
41 views

The primes such that removing digits from the right end leaves another prime

The number 73,939,133 is prime. Keep removing a digit from the right end. Each of the remaining numbers is prime. How to find other numbers with this property?
2
votes
1answer
38 views

Does there exist a sequence $(S_i)_{i=1}^{\infty},\ S_i=\pm1$ such that $\forall i(2+S_1g_1+S_2g_2+\cdots+S_ig_i\in\Bbb P)\wedge\exists i:S_i=-1$?

Consider a sequence $(S_i)_{i=1}^{\infty},\ S_i=\pm1$ other than $\{1,1,\ldots\}$. Let $g_i=p_{i+1}-p_i$, where $p_i$ is the $i$th prime. Is it possible that for all $k\in\Bbb Z^+,\ 2+\sum_{i=1}^...
1
vote
1answer
14 views

Does there exist a positive integer $k$ such that $(g_i^k)_{i=1}^{\infty},\ g_i^k=p_{i+k}-p_i$ is non-decreasing for all sufficiently large $i$?

Does there exist a positive integer $k$ such that $(g_i^k)_{i=1}^{\infty},\ g_i^k=p_{i+k}-p_i$ is non-decreasing for all sufficiently large $i$, where $p_i$ is the $ith$ prime? $g_{i+1}^k\geq g_i^k\...
4
votes
2answers
84 views

Generalisations of primes

I've read of (normal) primes, Gaussian primes and Eisenstein primes, which all uses different ways to define an integer to be a prime. For instance, $2$ factors into $1-i$ and $1+i$ for guassian ...
15
votes
1answer
220 views

Consequences of the negation of the Riemann hypothesis

There are many sources documenting the consequences of the Riemann hypothesis, but I can't find one discussing the consequences of its negation, particularly concerning the prime distribution. Can ...
1
vote
2answers
536 views

Prove that if p divides xy then p divides x or p divides y

I am given that the following proposition is true. (Proved in class) "Suppose that $x$, $y\in \Bbb Z$, not both zero. Then there exists $m$, $n\in\Bbb Z$ such that $$mx + ny = d$$ where $d$ is the ...
1
vote
0answers
38 views

Syndeticity and A.P.-richness of certain sets

Let $A \subset \mathbb{N}: \sum_{a \in A} (\frac{1}{a}) = \infty$; denote $\{ \alpha_1 @ \alpha_2: \alpha_1, \alpha_2 \in A \} = A @ A$, where "$@$" is any appropriate binary operator. (Note: $A$ is ...
0
votes
1answer
148 views

Prime number in set $\{1,…,60\}$

How can we calculate by using the principle of inclusions and exclusions how many prime numbers are in the set $ \{1, ..., 60 \} $?
0
votes
3answers
159 views

an irreducible polynomial over GF(2) is primitive over GF(2)

let $P \in F_{2} [X]$ of degree $7$, how to prove this: P is irreducible $\Leftrightarrow$ P is primitive i tried to use the mersenne prime !
3
votes
2answers
441 views

If $P$ and $Q$ are distinct primes, how to prove that $\sqrt{PQ}$ is irrational?

$P$ and $Q$ are two distinct prime numbers. How can I prove that $\sqrt{PQ}$ is an irrational number?
0
votes
1answer
28 views

Disproving using a Constructive Proof

I cannot find the n to prove the negation for the following: Disprove (Prove the negation) of: For every positive integer n, $3^n + 2$ is prime The way in which I have written the negation is: ...
3
votes
1answer
85 views

Given $0 < p < n$, prove there exists $n$ consecutive natural numbers such that each natural is divisible by at least $p$ distinct primes.

Given $0 < p < n$, prove there exists $n$ consecutive natural numbers such that each natural is divisible by at least $p$ distinct primes. Is there a general proof method to prove this ...
4
votes
3answers
250 views

Finding all the values of n, such that $ \varphi (n) = 12 $ [duplicate]

I have not broken this down very far. I have come to the conclusion that there are infinitely many values for n where there exists 12 coprimes to n. Since there are infinitely many primes, and primes ...
1
vote
0answers
40 views

Fundamental Theorem of Arithmetic (Canonical) missing crucial step

I've worked long on the proof of the fundamental theorem of Arithmetic and there is only one tiny piece left I can't wrap my head around. Suppose that $$\prod_{i=1}^r p_i^{m_i} = \prod_{j=1}^s q_j^{...
0
votes
1answer
52 views

Uses of Mersenne primes in math

There is an international search for Mersenne primes. The project is huge. But what are the uses of Mersenne Primes in math? Do they have any other properties other than being of the form $2^n-1$?
3
votes
1answer
88 views

Is this number composite or prime: $2000^{2002} + 2000^{2000} + 1$?

Is this number composite or prime? $$2000^{2002} + 2000^{2000} + 1$$ I want to find an easy approach to this problem.
6
votes
1answer
153 views

Normalizer and centralizer are equivalent when $p$ is the smallest prime dividing $|G|$

Let $p$ be the smallest prime dividing $|G|$, and suppose that some $P \in \mathsf{Syl}_p(G)$ is cyclic. Prove that $N_G(P) = C_G(P)$. So I let $G=p^\alpha m$ $p$ does not divide $m$. P is cyclic, ...
1
vote
0answers
158 views

Remarks on a Previous Post

Recently I have been reading this post and I have noted something significant in the fake argument. As one can easily see that the basic idea behind the argument had been to show that the sequence $...
0
votes
1answer
71 views

Is it an open problem about Riemman Hypothesis non-trivial zero? [duplicate]

Let's assume RH was correct, and $1/2+Ki$ is any one of non-trivial zero of $\zeta$, is following problem open? 1) $K$ is irrational number 2) $K$ is transcendental number
1
vote
1answer
44 views

can Sophie Germain prime be arbitrarily many?

We know that there exists arbitrarily long prime arithmetic progressions by BEN-TAO. Together with Dirichlet's theorem on arithmetic progressions, can we address that Sophie Germain prime number be ...
4
votes
1answer
115 views

Proof of $p_n<n^2$ by Elementary Means

Is there any proof of the inequality $p_n<n^2$ (for all sufficiently large $n$) by elementary means and without using Prime Number Theorem? I searched in google but in vain. The results that I ...
5
votes
1answer
266 views

Eulers totient function divided by $n$, counting numbers in the set [1,m] that are coprime to n

If we divide Euler's totient function $\omega(n)$ by $n$, we obtain a fraction. If we multiply this fraction by any natural number $m$ which gives us another natural number $p$, is it true that $p$ is ...
1
vote
2answers
144 views

Show that if $p$ is an odd prime, show a power $p^k$ can never be a perfect number

Show that if $p$ is an odd prime, show a power $p^k$ can never be a perfect number. I am little confused about this problem, any insight?
1
vote
2answers
384 views

If $m$ and $n$ are integers with $\gcd(m,n) = 1$, prove that $\sigma(mn)= \sigma(m)\sigma(n)$.

If $m$ and $n$ are integers with $\gcd(m,n) = 1$, prove that $\sigma(mn)= \sigma(m)\sigma(n)$. I am thinking about using the formula for $\sigma(p^k)$ where $p$ is prime. It follows from the ...
8
votes
2answers
238 views

On the difference between consecutive primes

Let $(p_n)$ be the sequence of prime numbers and $g_n = p_{n+1} - p_n$ Question: Is it known that $g_n \le n$? Remark: it's known that $g_n < p_n^{\theta}$ with $\theta = 0.525$ for $n$ ...
3
votes
2answers
54 views

Math for Computer Science

I have a couple of questions on the material in "Mathematics for Computer Science" by Eric Lehman and Tom Leighton. Q1. This is a theorem in the book: Theorem 24. Let $p$ be a prime. If $p|a_1a_2 ...
2
votes
1answer
93 views

Conjecture on sum of powers

Let $n$ be an odd number, $x,y$ integers and $p$ a prime number. Now, suppose that $p\ne n$ and $$ p|\frac{x^n+y^n}{x+y} $$ Then, I have been observed that $p \equiv 1 \pmod{n}$. This is, all of the ...
1
vote
2answers
80 views

Prime numbers and $\sqrt{10301}$

On my exam recently, we had the following question: Use the prime number theorem to estimate the number of primes less than $\sqrt{10301}$, and hence, give a concise argument whether 10301 is prime ...
1
vote
1answer
41 views

Something similar to Euler's theorem

If $p$, $q$ are not equal primes. $n=pq$, $\varphi(n) = (p − 1)(q − 1)$, $d = \gcd(p − 1, q − 1)$. Is it true that for any $a$ such that $\gcd(a, n) = 1$ holds $a^{\frac{\varphi(n)}{d}} \equiv 1 \...
2
votes
2answers
106 views

Finding prime solutions to $100q+80 = p^3 + q^2$

Finding prime solutions to $100q+80 = p^3 + q^2$ Does them being prime imply some patterns on division modulo 3 or some other integer? How is this done?