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

13
votes
4answers
1k views

Is there a sequence of 5 consecutive positive integers such that none are square free?

Is there a sequence of 5 consecutive positive integers such that none are square free? A number is square free if there is no prime number p such that $p^2 \mid n$ What I've tried doing so far is to ...
13
votes
1answer
817 views

Finding smallest and largest prime factor of $\frac{200!}{180!}$

I originally started off by listing all the primes: $p<200$ then trying to calculate the prime factorisation of each (which I realise is a silly thing to do) I believe there must be a simpler way ...
13
votes
8answers
1k views

Does the formula $\sqrt{ 1 + 24n }$ always yield prime?

I did some experiments, using C++, investigating the values of $\sqrt{1+24n}$. ...
13
votes
4answers
1k views

Proof that there are infinitely many prime numbers starting with a given digit string

To prove the following fact: given any sequence of digits in any base, eg 314159265358979323 base 10, there are infinitely many primes that start with these digits,eg when expressed in decimal they ...
13
votes
1answer
2k views

Prime with digits reversed is prime?

Well, just another idea came up into my mind and i have no idea how to solve it :D Is there infinitely many prime numbers, which are not repunits and their inverse is also prime? (For example, inverse ...
13
votes
2answers
246 views

Prove that $m^{2013}-m^{20}+m^{13}-2013$ has at least $N$ prime divisors

for positive integer $N>1$,There always exists $m$ such that $$m^{2013}-m^{20}+m^{13}-2013$$ has at least $N$ prime divisors Thank you all, this is good problem, but I don't know how to solve it.
13
votes
1answer
280 views

What is the smallest integer $n$>1 such that $n^{5000}+n^{2013}+1$ is prime?

Which is the smallest integer $n>1$, such that $$n^{5000}+n^{2013}+1$$ is prime ? Since $x^{5000}+x^{2013}+1$ is irreducible over $\mathbb{Q}$ and has value $1$ for $x=0$, there should be ...
13
votes
2answers
262 views

$x^2+x+1$ is the cube of a prime.

Please help me find all natural numbers $x$ so that $x^2+x+1$ is the cube of a prime number.(Used in here)
13
votes
1answer
359 views

Primey Pascal's Triangle

Imagine that we have a triangle that starts with 2,3 and grows like Pascal's triangle but instead uses the smallest prime $\geq$ to the sum of the above two primes. Visually: $$ ...
13
votes
2answers
1k views

Twin, cousin, sexy, … primes

Twin, cousin, and sexy primes are of the forms $(p,p+2)$, $(p,p+4)$, $(p,p+6)$ respectively, for $p$ a prime. The Wikipedia article on cousin primes says that, "It follows from the first ...
13
votes
1answer
754 views

What's the probability that a sum of dice is prime?

Prompted by today's Minute Math question on the MAA site (http://amc.maa.org/mathclub/5-0,problems/T-problems/T-web,ia/2005web/tb05-12-ia.shtml), I started thinking about the probability that the sum ...
13
votes
4answers
731 views

Is every prime the average of two other primes?

$\forall {p_1\in\mathbb{P}, p_1>3},\ \exists {p_2\in\mathbb{P},\ p_3\in\mathbb{P}};\ (p_1 \neq p_2) \land (p_1\neq p_3) \land (p_1 = \frac{p_2+p_3}{2})$ Now I'm not a 100% sure about this, but I ...
13
votes
2answers
301 views

Number of digits until a prime is reached

Begin with a random digit from $1$ to $9$. Add a random digit to the right-hand side from $0$ to $9$ until a prime number is reached. How many digits are necessary in the avarage ? More precisely: ...
13
votes
1answer
196 views

Primes in $\lfloor a^{n} \rfloor$

Motivated by the question Is there any result, that says that $\lfloor e^{n} \rfloor$ is never a prime for $n>2$?, take a real number $a>1$ and consider the sequence $\lfloor a^{n} \rfloor$. ...
13
votes
1answer
378 views

Prime spiral distribution into quadrants

Is it known that the primes on the Ulam prime spiral distribute themselves equally in sectors around the origin? To be specific, say the quadrants? (Each quadrant is closed on one axis and open on ...
13
votes
1answer
562 views

Going from $\Lambda$ to a prime count

A 1997 paper of Étienne Fouvry and Henryk Iwaniec, Gaussian primes, concerns the prevalence of primes that are of the form $n^2+p^2$ for prime $p$. The asymptotic result is $$\sum_{n^2+p^2\le ...
13
votes
2answers
337 views

Euler's Totient function $\forall n\ge3$, if $(\frac{\varphi(n)}{2}+1)\ \mid\ n\ $ then $\frac{\varphi(n)}{2}+1$ is prime

While I was studying Euler's Totient function, $\varphi(n)$, I stumbled upon the marvelous book "Index to Mathematical Problems, 1980-1984" By Stanley Rabinowitz. In this page of the book (link to ...
13
votes
1answer
351 views

An estimate for relatively prime numbers

Fix a finite collection of distinct prime numbers $(p_1, p_2, \dots, p_s)$, denote their product by $N$. For a natural number $n$ let $\beta(n)$ be the number of $k$, $k\leq n$, for which $k$ and $N$ ...
13
votes
0answers
65 views

What other prime numbers have been ruled out as counterexamples to the Feit-Thompson conjecture?

Given distinct primes $p$ and $q$, $$\frac{p^q - 1}{p - 1}$$ is never a divisor of $$\frac{q^p - 1}{q - 1}.$$ Or so we believe. If $p = 2$, then it's clear that no odd prime $q$ can make a ...
13
votes
0answers
428 views

Sorting of prime gaps

Let $g_i $ be the $i^{th}$ prime gap $p_{i+1}-p_i.$ If we re-arrange the sequence $ (g_{n,i})_{i=1}^n$ so that for any finite $n$ the gaps are arranged from smallest to largest we have a new sequence ...
12
votes
5answers
2k views

Why does one counterexample disprove a conjecture?

Can't a conjecture be correct about most solutions except maybe a family of solutions? For example, a few centuries ago it was widely believed that $2^{2^n}+1$ is a prime number for any $n$ . For ...
12
votes
6answers
3k views

Prime factorization of 1

Fundamental Theorem of Arithmetic says every positive number has a unique prime factorisation. Question: If 1 is neither prime nor composite, then how does it fit into this theorem?
12
votes
5answers
2k views

Is there a one-to-one function from the natural numbers to the primes?

Is there a function $f : \mathbb N \rightarrow \mathbb P$, where $\mathbb P = \{p \in \mathbb N \mid \ p$ is prime$\}$, such that $f$ is injective? It is known that no such polynomial function exists. ...
12
votes
6answers
15k views

Determine whether a number is prime

How do I determine if a number is prime? I'm writing a program where a user inputs any integer and from that the program determines whether the number is prime, but how do I go about that?
12
votes
3answers
502 views

Twin primes of form $2^n+3$ and $2^n+5$

How to prove that $2^n+3$ and $2^n+5$ are both prime for only finitely many integers $n$? And how to prove that there are infinitely many primes of the form $2^n+3$ and $2^m+5$
12
votes
5answers
2k views

Prove a number is composite

How can I prove that $$n^4 + 4$$ is composite for all $n > 5$? This problem looked very simple, but I took 6 hours and ended up with nothing :(. I broke it into cases base on quotient remainder ...
12
votes
7answers
10k views

Is a prime factor of a number always less than its square root?

I was going through the fundamental theorem in Number Theory where any non zero integer n can be represented as a product of distinct primes. A related problem with this theorem is to prove that for ...
12
votes
3answers
380 views

Are there any Combinatoric proofs of Bertrand's postulate?

I feel like there must exist a combinatoric proof of a theorem like: There is a prime between $n$ and $2n$, or $p$ and $p^2$ or anything similar to this stronger than there is a prime between $p$ and ...
12
votes
4answers
2k views

Prime Partition

A prime partition of a number is a set of primes that sum to the number. For instance, {2 3 7} is a prime partition of $12$ because $2 + 3 + 7 = 12$. In fact, there ...
12
votes
5answers
433 views

How many prime numbers are there in between $1000!+1$ and $1000!+1000$, inclusive?

I know $1000!$ is not a prime number as any number $1000$ or less is a divisor, but how would I know if $1000!+1$ is prime? Any hints? Also, use the above question to prove that you can find $n$ ...
12
votes
1answer
164 views

What is the significance of the power of $3$ in the sequence of primes given by $\lfloor A^{3^n}\rfloor ?$

Mill's constant is a number such that $\lfloor A^{3^n}\rfloor$ is prime for all $n$. The existence of such an $A$ was proven in $1947$. I know little about number theory, but I am curious as to why ...
12
votes
2answers
389 views

How rare are the primes $p$ such that $p$ divides the sum of all primes less than $p$?

This is just for fun! The title pretty much says it all. It's probably a very difficult question. Up to the $40,000^{th}$ prime $(479909)$, I have found only $5$, $71$ and $369119$ with this ...
12
votes
1answer
164 views

Is $\sum\frac1{p^{1+ 1/p}}$ divergent?

Is $\displaystyle\sum\frac1{p^{1+ 1/p}}$ divergent? How can we prove that it is divergent or convergent in analytic number theory? I know what bound of the n-th prime number is, and that its order is ...
12
votes
2answers
838 views

nth powers modulo all primes

Let $a \in \mathbb{Z}$, $n \in \mathbb{N}^*$ be integers, and set $P=X^n - a$. Let us consider the three following statements : 1) $P$ has a root in $\mathbb{Z}$ (i.e. $a$ is an nth power) 2) $P$ ...
12
votes
2answers
235 views

An upper bound for $\log \operatorname{rad}(n!)$

Let $n>1$ be an integer and let $\operatorname{rad}(n!)$ denote the radical of $n$-factorial. (The radical of an integer $m$ being, loosely speaking, the product of the prime divisors of $m$.) Can ...
12
votes
3answers
443 views

Number Theory or Algebra?

Prove that if $4^m-2^m+1$ is a prime number, then all the prime divisors of $m$ are smaller than $5$ I initially thought about putting $4^m-2^m+1=p$ where $p$ is some prime and after eliminating ...
12
votes
1answer
387 views

A simple way to obtain $\prod_{p\in\mathbb{P}}\frac{1}{1-p^{-s}}=\sum_{n=1}^{\infty}\frac{1}{n^s}$

Let $ p_1 <p_2 <\ldots <p_k <\ldots $ the increasing list in set $\mathbb{P}$ of all prime numbers . By Infinite geometric series $\sum_{k=0}^\infty r^k = \frac{1}{1-r}$ for all $s>1$ ...
12
votes
1answer
275 views

The number of prime years in a lifetime

$2013$ is not a prime: $3 \times 11 \times 61$. I was born in a prime year, and if I live as expected according to the statistics for U.S. males, I will just reach another prime year, $2027$. That ...
12
votes
3answers
296 views

Divergence for $p$ prime numbers and convergence for $m$ composite numbers

Does there exist a sequence $(a_n)_{n\in \mathbb N} \in \mathbb C^{\mathbb N}$ such that : For all $p$ prime numbers the series $\displaystyle \sum_{n\in \mathbb{N}} a_n^p$ diverges, and for ...
12
votes
2answers
368 views

Are there Groups of Strictly Primes

Motivation Since Euclid's proof of the infinitude of the primes, the structure and properties of primes has always fascinated mathematicians. This lead to great work in their properties and ...
12
votes
1answer
556 views

Find all primes $p$ such that $\dfrac{(2^{p-1}-1)}{p}$ is a perfect square

Find all primes $p$ such that $\dfrac{(2^{p-1}-1)}{p}$ is a perfect square. I tried brute-force method and tried to find some pattern. I got $p=3,7$ as solutions . Apart from these I have tried for ...
12
votes
2answers
1k views

Elementary proof of Zsigmondy's theorem

I've been writing a not-so-short introduction to elementary number theory, supplying proofs for all theorems. When coming across Zsigmondy's theorem, it seemed difficult to find a proof available on ...
12
votes
1answer
291 views

Chebyshev: Proof $\prod \limits_{p \leq 2k}{\;} p > 2^k$

How do I prove the following: $$\prod_{p \leq 2k} \; p > 2^k \text{ with } p \in \mathbb{P}$$ I tried induction, but I didn't know how to go on because I don't have a look at all numbers. ...
12
votes
2answers
585 views

On prime factors of $n^2+1$

It is a well-known conjecture that there are infinitely many primes of the form $n^2+1$. However, there are weaker results that one can prove. For example, There are infinitely many positive ...
12
votes
2answers
408 views

Prime one heap Nim

I have been working on an interesting problem my lecturer mentioned recently. Prime Nim is a variant of the Nim game where you have a single pile with an arbitrary number $n\in \Bbb N+\{0\}$ of ...
12
votes
1answer
228 views

Sequences for that $\sum_{n} \frac{1}{x_n}$ is divergent and $\sum_{n} \frac{1}{x_n \ln x_n}$ is convergent

We will denote with $(x_n)$ a given sequence and we introduce the following two series. $$S^* = \sum_{n} \frac{1}{x_n} \quad \text{and} \quad S_* = \sum_{n} \frac{1}{x_n \ln x_n}.$$ We know that if ...
12
votes
2answers
730 views

Ulam spiral: Is there an “unusual amount of clumping” in prime-rich quadratic polynomials?

I was reading Martin Gardner's Mathematical Games column on the Ulam spiral which appeared in the March 1964 issue of Scientific American. (The spiral actually featured on the cover of that issue.) ...
12
votes
3answers
292 views

Prove or disprove: $99^{100}+100^{101}+101^{99}+1$ is a prime number

Prove or disprove: $$99^{100}+100^{101}+101^{99}+1$$ is a prime number. My idea: let $100^{101}=x^{x+1}$,then $$99^{100}+100^{101}+101^{99}+1=(x-1)^{x}+x^{x+1}+(x+1)^{x-1}+1$$ is prime number? I ...
12
votes
1answer
534 views

Can the order of 2 mod p be arbitrarily small (relative to $p - 1$)?

Given a prime number $p$, let $\operatorname{ord}_p(2)$ be the multiplicative order of $2$ modulo $p$, i.e., the smallest integer $k$ such that $p$ divides $2^k - 1$. By Lagrange's theorem, ...
12
votes
1answer
498 views

Diophantine equation involving prime numbers : $p^3 - q^5 = (p+q)^2$

Find all pairs of prime nummbers $p,q$ such that $p^3 - q^5 = (p+q)^2$. It's obvious that $p>q$ and $q=2$ doesn't work, then both $p,q$ are odd. Assuming $p = q + 2k$ we conclude, by the equation, ...