Prime numbers are natural numbers 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

0
votes
0answers
19 views

Improved Betrand's postulate

I want to show that $2p_{n-2} \geq p_{n}-1$... Bertand's postulate shows us that $4p_{n-2}\geq p_{n}$ but can we improve on this? any ideas?
5
votes
1answer
188 views

Wilson's Theorem - Why only for primes? [on hold]

Why is it true that Wilson's Theorem only holds for prime numbers? I read a proof of it, and it did not seem to cater to that aspect of the theorem.
0
votes
1answer
30 views

Prime counting function [duplicate]

How much of an impact would the discovery of an exact formula that is equivalent to the prime counting function have on the mathematics community and acedemia as a whole?
-1
votes
1answer
40 views

Question on occurrences of prime gaps [on hold]

Why is the number of times a prime gap $p_{n} - p_{n-1}$ is above $\ln(p_{n-1})$ always the same as the number of times it occurs below $\ln(p_{n-1})$?
14
votes
4answers
1k views

What is the symbol for primes?

Although there isn't much difference between $\mathbb{Z},\mathbb{N},\mathbb{I}$, they are well-known, and each one gets its own distinguished symbol. Is there any reason that primes don't get their ...
0
votes
0answers
38 views

Puzzle on multiplying by fixed values to reach a target number.

So, this one's tricky. There's a keycode combination, and there are six buttons. Each button multiplies the base number of 1 by their respective multipliers (see below). Once the result number gets ...
9
votes
1answer
186 views

Proof of infinitude of prime elements?

All proofs of infinitude of primes which I know of essentially prove that there are infinitely many irreducible elements of $\Bbb Z$, and with this goal in mind we can very easily extend this proof to ...
9
votes
1answer
138 views

What do we know about the first occurrences of prime gaps?

Are there any conjectures from which we can infer something about the first occurrences of prime gaps length $n$ and their distribution? I've made an interesting graph of these values to make this ...
-2
votes
0answers
166 views
+100

Goldbach conjecture related thinking

Background The sequences $a_k = 2(p-1)k + p$ yield many prime numbers when $p$ is a prime number. (Test it) $2p \equiv 2 \bmod{(2p-2)} \equiv 2 \bmod {(2(p-1))}$ Direction Following from ...
0
votes
1answer
31 views

question about first occurring prime gaps

If a prime gap $g(p)$ is the first occurring prime gap of it's size, does this imply that it is also the largest gap below $p$? In other words, is the set of first occurring prime gaps contained ...
5
votes
2answers
84 views

Why is it that the product of first N prime numbers + 1 another prime? [duplicate]

Recently I came across this proof for fact that primes are infinite. It's a proof by contradiction. The proof assumes that primes are finite and there is a prime M which is larger than any prime out ...
3
votes
2answers
63 views

Indexes of prime Fibonacci numbers

I found this on Mathworld, but I can't seem to find any proof, either on StackExchange, nor any other site: Why do all Fibonacci primes, except for $F_4=3$, have prime indexes (with $F_0=0$)? My ...
1
vote
1answer
28 views

Fermat primality test and Fermat pseudoprime

What is the difference between Fermat primality test and Fermat pseudoprime?Can anyone explain me how we use them ?
0
votes
1answer
39 views

Prime Number Algorithm

function isPrime(n) { // If n is less than 2 or not an integer then by definition cannot be prime. if (n < 2) {return false} if (n != Math.round(n)) {return false} // Now assume that n is ...
0
votes
0answers
70 views

Sets with $n$ prime numbers [on hold]

Let $n>2$ a natural number. We define the following sets: $$S=\{1 \leq a \leq n : (a,n)=1, a^{n-1} \not\equiv 1\pmod n\} \\ T=\{1 \leq b \leq n : (b,n)=1, b^{n-1} \equiv 1 \pmod n\}$$ ...
1
vote
0answers
23 views

Calculating $n$-th $q:P(q)=p \in \Bbb P$

Let $P(x)$ denote the number of ways of writing an integer $x$ as a sum of positive integers (where permutation of the array of integers in the sum doesn't count). Ex: $P(1)=1, P(2)=2,P(4)=5$. Let ...
1
vote
2answers
75 views

The product of two prime numbers

I have two expressions (both of which have a term raised to the power of $n$) and I am trying to prove that they can't be prime numbers at the same time for $n>2$. I can't post the expressions, ...
1
vote
2answers
31 views

Is there a method to determine a prime number containing the first n digits?

For example, the number $10243$ is prime and contains the digits '0,' '1,' '2,' '3,' and '4.' Similarly, the number $20143$ is prime. Is there a method to determine whether a prime number exists ...
1
vote
3answers
27 views

Finding all the divisors of $a$ by decomposing it into the product $p^{\alpha_1}_{1} \cdot p^{\alpha_2}_{2} \cdots p^{\alpha_r}_{r}$

I'm trying to prove the following statement regarding the fundamental facts of prime numbers, but I don't really understand the relationship between $a$ and $b$. In order to find all the divisors ...
4
votes
0answers
62 views

What is the next prime with this form? [duplicate]

The following are primes, $$P_1 = 2^2 + 3^3$$ $$P_2 = 2^2 + 3^3 +5^5 + 7^7$$ After these two, the only prime of such form I've found is, $$P_3 = 2^2 + 3^3 + 5^5 + 7^7 + 11^{11} + 13^{13} +\dots+ ...
9
votes
2answers
465 views
+100

Prime Numbers and a Two-Player Game

In this question, $\mathbb{N}_0$ is the set of all nonnegative integers. The notation $\mathbb{N}$ is reserved for the set of all positive integers. Alex and Beth are playing the following game. ...
5
votes
2answers
247 views

Inequality involving a product over the primes

Is there someone who is able to prove the following statement? $$\prod_{m=1}^n \dfrac{p_m-1}{p_m} \leq \dfrac{1}{\ln(n)}$$ for all integers $n >1$ where $p_m$ is the $m$-th prime number.
5
votes
2answers
134 views

Is $a=\frac{1992!-1}{3449\times 8627}$ a prime number?

Is $a=\dfrac{1992!-1}{3449\times 8627}$ a prime number ? This is a natural follow-up to that recent MSE question We know that $a$ has $5702$ digits and no prime divisor $<10^6$.
-2
votes
1answer
20 views

inequality on Gaussian prime

Consider any Gaussian prime $p$ (except $|p|=\sqrt{2}$). If we have $|x|\leq|p|+0.5$, where $x$ is a nonzero Gaussian integer, can we prove $|x|\leq|p|$?
-2
votes
0answers
49 views

Summation of prime multiples less than n

How can I sum the following $$ \sum (2^x\cdot3^y\cdot5^z\cdot7^w\cdot\prod_1^m(p_i^{a_i})) $$ with $$2^x\cdot3^y\cdot5^z\cdot7^w\cdot\prod_1^m(p_i^{a_i}) \le n$$ where $p_i \ge 11$ are list of fixed ...
2
votes
1answer
57 views

How to show $n$ is a prime number?

Let $a$ and $n$ be integers greater than 1. Suppose that $a^n-1$ is a prime. Show that $a=2$ and $n$ is a prime. What can you say about primes of the form $2^n+1$? By ...
1
vote
0answers
49 views

Are logarithms of prime numbers algebraically independent?

From Baker's theorem it follows that a linear combination of natural logarithms of prime numbers with non-zero algebraic coefficients can never be zero. Has it been proved that the set of all natural ...
24
votes
2answers
569 views

Is $1992! - 1$ prime?

Consider the factorials, defined inductively by $1! = 0! = 1$ and $n! = n\cdot(n-1)!$ for $n \geq 2$. Question: Is $1992!-1$ a prime number? The question is from a book, maybe is contest math ...
2
votes
1answer
63 views

Is the Green-Tao theorem valid for arithmetic progressions of numbers whose Möbius value $\mu(n)=-1$?

I am reading the basic concepts of the Green-Tao theorem (and also reading the previous questions at MSE about the corollaries of the theorem). According to the Wikipedia, the theorem can be stated ...
4
votes
0answers
123 views

A lower bound for an arithmetic function

Let $N \in \mathbb{N}$ such that $\phi(N) \sim N$, where $\phi$ is the Euler's totient function. Let $A \subset [N] := \{1, 2, \ldots, N\}$. For $n \in \mathbb{N}$ define the function $$ C_A(n) = \#\{ ...
1
vote
3answers
62 views

Upper bound for prime-counting function: $ \pi(n)\le\frac{n}{3}+2 $

$ \pi(n)\le\frac{n}{3}+2 $... Could someone explain me, how to prove it? I'm completely stuck, as informations I found on Wikipedia aren't very clear to me. (I was able to prove that for sufficiently ...
0
votes
0answers
15 views

Prove that if $\ p^2 = a^2+2b^2 $ then $\ p = m^2+2n^2 $ (where a, b, m, n are integers, and p is prime) [duplicate]

Given that $\ p^2$ can be written in the form $\ p^2=a^2+2b^2 $ (where a & b are integers, and 'p' is a prime number), then prove that the prime number 'p' can also be written in the form $\ ...
31
votes
2answers
443 views

Proving that if $p^2 = a^2 + 2b^2$ then also $p$ can be written in form $a^2 +2b^2$

I'm high school student, and this problem has bothered me for about 2 weeks now. I don't necessarily need a solution, but for example mentioning a helpful theorem or property that could help me to ...
6
votes
3answers
71 views

sequence of primes in arithmetic progression

The question is: Suppose $p_1<p_2<...<p_{15}$ is a sequence of prime numbers in arithmetic progression, with common difference $d$. Prove that $d$ is divisible by $2,3,5,7,11$ and $13$. Let ...
0
votes
2answers
40 views

Property of additive group [closed]

Let $m \in \mathbb{Z}_q$, for a prime $q$ and $x \in \mathbb{A}$, where $\mathbb{A}$ is an additive group of order $q$. Then is it always true that $mx \in \mathbb{A}$? If true, how to prove it? ...
0
votes
1answer
33 views

Wieferich prime-Lang-Trotter conjecture connection?

Crandall-Dilcher-Pomerance prediction states that the number of Wieferich primes $<x$ is $log\ logx $ N.Katz in "WIEFERICH PAST AND FUTURE" states; The Crandall-Dilcher-Pomerance prediction is ...
1
vote
2answers
58 views

How many number id divisible by $p$ and is not divisible by any primes number which is less than $p$?

Let $N$ be a big integer. Let $p$ be a prime number. Is there a formula to count how many number less than $N$ such that they are divisible by $p$ and not divisible by any prime less than $p$. For ...
1
vote
1answer
44 views

In the definition of Carmichael number, why is it necessary to have $(b, n) = 1$?

In number theory, a Carmichael number is a composite number $n$ which satisfies the modular arithmetic congruence relation $$b^{n-1}\equiv 1\pmod{n}$$ for all integers $1<b<n$ which are ...
0
votes
1answer
55 views

Can a Carmichael number be even?

Can a Carmichael number be even? I know that a Carmichael number is a positive composite integer $n$ such that $a^n\equiv a \pmod n$ for all integer $a$. So what does I need to prove or disprove ...
2
votes
1answer
59 views

ABC conjecture consequence

At page 6 of the book: "Prime Numbers The most mysterious figures in Math" this statement is listed as one of the consequences of the ABC conjecture: There are Infinitely many Wieferich primes. This ...
0
votes
3answers
59 views

The square of n+1-th prime is less than the product of the first n primes.

I wanted to prove the following question in an elementary way not using Bertrand postulate or analytic estimates like $x/\log x$. The question is $$ p_{n+1}^2<p_1p_2\cdots p_n,\qquad(n\geq4) $$ I ...
3
votes
4answers
109 views

Find the smallest positive integer that ends in $17$, is divisible by $17$, and the sum of its digits is equal to $17$.

This is a very interesting word problem that I came across in an old textbook of mine. So I know its got something to do with primes and composities but other than that, the textbook gave no hints ...
0
votes
3answers
71 views

Prime number equation

The number of solutions of the equation $xy(x+y)=2010$ where $x$ and $y$ denote positive prime numbers, is ____ I tried various things but nothing seems to work out. $2010$ can be resolved into ...
9
votes
1answer
474 views

Primes and certain unit fractions [closed]

Are there primes $p,q$ and a natural number $a$ such that $\frac{1}{p}+\frac{1}{q}=\frac{1}{a}$?
1
vote
2answers
46 views

Largest Arithmetic Sum of Relatively Prime Numbers Under 30

Pick however many integers in the range $[1,30]$ (inclusive). The only constraint is that all of these numbers must be relatively prime to each other. What is the largest possible arithmetic sum ...
0
votes
1answer
35 views

What does “421 is the smallest prime formed by the powers of two in logical order from right to left” mean and if so is it correct?

I've seen this on number gossip and a few other places, but I'm not exactly sure what it means. The only possibilities I have thought of for what they mean are "421 is the smallest center squared ...
1
vote
0answers
26 views

The asymptotic behaviour of triples $n!+q^{n!}=c$, where $q$ is the first prime greater than $n$, and abc conjecture

For a large positive integer $n$, let $q=q(n)$ (below we denote this $q=q(n)$ by $q_{N}$ because we assumed that is the $N$-th prime number) the first prime number which is (strictly) greater that ...
1
vote
1answer
45 views

What does the sum of the reciprocals of composites run along?

This is fairly straight forward: $$\sum_{p\space\text{prime}}^x \frac{1}{p_x} \sim \ln(\ln(x))$$ And if $$\sum_{c\space \text{composite}}^x \frac{1}{c_x}\sim f(x)$$ Then what is $f(x)$?
1
vote
2answers
63 views

Modulus and Fermat's Little Theorem

How do I calculate $ 11^{23} \bmod{163} $ using fermat's little theorem ?
0
votes
1answer
36 views

Counting how many primes exists between square root of a given range?

I am given with a range say l,r(1<=l,r<=10pow14).I am also given with cumulative count of primes no.'s that exists between 1 to 10pow7,e.g for 1,count=0(as no primes exists upto 1),for ...