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

10
votes
5answers
1k views

Disproving the claim that the numbers 1+2+4, 1+2+4+8, 1+2+4+8+16… alternate between prime and composite

I am working through an elementary number theory book and I have come across the following problem. Show the following claims are wrong: Claim 1: The sequence 1+2+4, 1+2+4+8, 1+2+4+8+16, ...
1
vote
1answer
58 views

prime division problem

$a,b,c \in$ {0,1,2,...,9} with at least one of $a,b,c$ nonzero. Prove that the six-digit integer $abcabc$ is divisible by at least 3 distinct primes. My thinking is not to use induction as there is ...
3
votes
2answers
41 views

Automorphisms of $\langle \mathbb{N}, \cdot \rangle$

It is an elementary fact that multiplication in $\mathbb{N}$ is commutative: $$(\forall n,m)\ n \cdot m = m \cdot n$$ This - among other things - implies that the representation of an $n \in ...
2
votes
0answers
24 views

Differences between large numbers with many factors has little factors

I apologise beforehand for the informality and lack of precision in this question but it is that way because it comes from only an intuition, nothing more than a heuristic argument. Say one has two ...
0
votes
1answer
34 views

How would you show $\pi(x)\log(1-\frac{1}{x}) \sim \frac{1}{\log x}$

How would you show $\pi(x)\log(1-\frac{1}{x}) \sim \frac{1}{\log x}$? Would you use $\lim_{x\to \infty}\frac{\pi(x)\log(1-\frac{1}{x})}{\frac{1}{\log x}} = 1$? and how would you show this? Can you ...
1
vote
1answer
59 views

Induction on prime numbers

To dive straight into the question: is there a form of induction which works on prime numbers? I've thought, and while I'm pretty sure it can be done om numbers such as even numbers or numbers ...
1
vote
1answer
40 views

A better way to prime factorize a set of numbers?

Let's say I have a range of numbers starting from 1 to 10^9 and I need to prime factorize each one of them.My basic algorithm is: 1.Use prime-sieve algorithms(Atkins or Eratosthenes(segmented ...
0
votes
2answers
53 views

$2p-2$ as the sum of consecutive prime numbers

Progress: Let $p$ be a prime such that $p≡1$ (mod 6) then $2p-2$ can be written uniquely (up to the order of addends) as the sum of some consecutive prime numbers. These are first ten examples: ...
2
votes
2answers
75 views

Do the ratios of successive primes converge to a value less than 1?

I think it's a pretty straightforward question. Does $\lim_{n \to \infty}{\frac{p_n}{p_{n+1}}} < 1?$ ***$p_n$ denotes the nth prime. Since the average gap increases between successive primes by ...
2
votes
1answer
32 views

Algorithm to identify complex Mersenne primes?

I am thinking on the complex analogue of the Mersenne primes. I think, some like a "complex Mersenne prime" could be a complex prime in the form $$2^{a+b\frac{pi}{2}i}-1$$ Where $a+bi$ is a complex ...
0
votes
1answer
34 views

How many distinct lists of 14 integers $L=\{v_1,\ldots ,v_{14}\}$ exist satisfying $v_i \geq v_{i+1}\geq 0$ and $\sum _{i=1}^{14}(v_i) \leq 54$

I am trying to solve the following problem: I have an ordered list of integers $L = \{v_1,\ldots ,v_{14}\}$ with fourteen elements, satisfying the following two conditions: $v_i \geq v_{i+1}\geq 0$ ...
1
vote
1answer
54 views

Implementing a function in PARI/GP

I want to define a function: $$g(n)= \begin{cases} +1 & \text{if $n=1$},\\ +1 & \text{if $n$ is an odd indexed prime}, \\ -1 & \text{if $n$ is an even indexed prime},\\ (-1)^r & ...
0
votes
1answer
59 views

Count numbers with prime digit

Given a number N I need to find the count of the numbers that have atleast one prime digit (2,3,5 or 7) in it. Now N can be upto 10^18.What is the best approach to solve this problem. Example : Let ...
2
votes
1answer
30 views

Finding the lowest number (or an upper bound to the lowest number) not congruent to a set of moduli

Note: if finding x is not possible, an upper bound, where there must be at least one number less than said number which is not congruent to the set, would be helpful. The set: For my purposes, the ...
2
votes
1answer
44 views

Is $\sum_{n=1}^N e^{2 \pi p_n z i}$ bounded for irrational $z$?

Let $p_n$ be the $n$th prime number. If $z$ is irrational real, is it known whether the partial sums $\sum_{n=1}^N e^{2 \pi p_n z i}$ are bounded? It seems the partial sums are unbounded if $z$ is ...
3
votes
2answers
87 views

Fastest way to find if a given number is prime

Given a random number, what would be the quickest possible way of finding out whether it was prime? Obviously, one could just iterate through the number in order to see if it was divisible by ...
3
votes
0answers
104 views
+50

Prove modular equivalence related to carmichael function.

Statement if $n=p_1p_2p_3\cdots p_r$ (prime numbers are distinct) and $2 \le a \le n-1$ then prove that $$a^{k\lambda} \equiv \left(1+\sum_{p_i\mid\gcd(a,n)}\left(\dfrac{n}{p_i} \right) ...
11
votes
3answers
296 views

Consecutive Prime Gap Sum (Amateur)

List of the first fifty prime gaps: 1, 2, 2, 4, 2, 4, 2, 4, 6, 2, 6, 4, 2, 4, 6, 6, 2, 6, 4, 2, 6, 4, 6, 8, 4, 2, 4, 2, 4, 14, 4, 6, 2, 10, 2, 6, 6, 4, 6, 6, 2, 10, 2, 4, 2, 12, 12, 4, 2, 4. My ...
0
votes
2answers
36 views

Asymptotic behaviour of $\prod_{p \leq x} (1 + 4/(3p) + C p^{-3/2})$

I'm reading Montgomery and Vaughan and in it they state quite simply \begin{equation} \prod_{p \leq x} \left(1 + \frac{4}{3p} + \frac{C}{p^{3/2}} \right) \ll (\log x)^{4/3} \end{equation} as $x ...
0
votes
1answer
49 views

Is there a 10-digit emirp?

Does a 10-digit emirp exist? Unfortunately, the lists of emirps I could find on the Web are quite small and my programming skills aren't good enough to write a program to check all the primes up to ...
0
votes
2answers
61 views

$6n+1$ and $6n-1$ prime format

I recently stumbled upon a fact that all prime numbers past $3$ are of the form either $6n-1$ or $6n+1$. Is it true? at least for numbers less than $10^9$. And does it cover all primes?
0
votes
2answers
61 views

What percent of numbers are primes? [duplicate]

I understand that there are infinitely many primes and (obviously) infinitely many integers, but is there any way to calculate the total percentage of integers that are primes? Thanks
0
votes
1answer
26 views

Infinite Wilson Prime proof

An article I read recently about Wilson Primes stated that, while 5, 13, and 563 are the only known terms, there is an infinite number of Wilson Primes. I was wondering if someone could verify this ...
-1
votes
1answer
21 views

Two positive integers and coprime relationship [closed]

Let $a$ and $b$ be two positive integers. If $2^a - 1$ and $2^{b-1}$ are coprime then $2^b - 1$ and $2^{a-1}$ are also coprime? Please kindly advise.
2
votes
1answer
48 views

Iterated Pi function

Does anyone have any information on iterating the prime counting function. Specifically, $\pi_n(x)$=$\pi(\pi_{n-1}(x))$, and $\pi_1(x)$=$\pi(x)$. I'm looking for anything on this function, what it may ...
2
votes
2answers
57 views

Diophantine: $px^2+2=y^2$ where $p\in \mathbb{P}$

Solve the Diophantine Equation: $px^2+2=y^2$, where $p$ is a prime number and $x,y$ integers. I tried this for ages but didn't get anywhere, but I don't know any advanced machinery since I am only in ...
7
votes
1answer
70 views

What is $\limsup\limits_{n\rightarrow\infty}\left\{\frac{p_{m+1}}{p_m}|m\in \mathbb{N},m\geq n\right\} $?

What is $$\limsup\limits_{n\rightarrow\infty}\left\{\frac{p_{m+1}}{p_m}\middle|m\in \mathbb{N},m\geq n\right\} = ?$$ where $p_i$ is i'th prime number. We know that this limsup exists because of ...
2
votes
2answers
156 views

Prime Number Sum Sequence (Amateur)

SOLVED: This is false Beginning with 3, add the next consecutive prime (2) and then take that sum (5) and add that to next consecutive prime (3) to get (8), and so on... $$ 3 + 2 = 5 $$ $$ 5 + 3 = 8 ...
0
votes
2answers
48 views

Number theory divisibility - simple way to prove this is prime?

Suppose that $y$ is a positive integer, and $z$ is the largest factor of $y$ such that $z<y$, then let $x=y/z$. Prove that $x$ must be a prime number. Is there a simple way to solve this? It ...
1
vote
2answers
89 views

Property of set of prime numbers

let $\{p_1,p_2,p_2,\cdots ,p_r\}$ be the set of $r$($\ge2$) pair wise distinct prime numbers i.e.., $(i\ne j \implies p_i \ne p_j)$ for all $1\le i,j\le r$ ${Statement}$ : For any such ...
5
votes
0answers
181 views

Sorting of prime gaps

Let $g_n $ be the $n^{th}$ prime gap $p_{n+1}-p_n.$ If we re-arrange the sequence $ (g_n)$ so that for any finite $n$ the gaps are arranged from smallest to largest we have a new sequence ...
0
votes
0answers
40 views

Number of prime factors of Mersenne numbers

Let $p$ be a prime and let $M_p = 2^p-1$. Is it known whether the number of prime factors of $M_p$ is unbounded above as $p \to \infty$? Also do the probabilities estimating the chance that $M_p$ is ...
1
vote
1answer
32 views

Programming site for cryptography [closed]

Are there any programming contests or sites that primarily focus on cryptography and number theory? I know of Codechef, spoj, Project Euler etc. but all are based on general concepts and not focused ...
5
votes
1answer
58 views

Is any elementary proof important (beside Selberg's work) ?

Is any elementary proof important (beside Selberg's work) ? Plus, why is the elementary proof of prime number theory by Selberg so important ? Selberg was awarded the Field medal is mainly because ...
1
vote
1answer
32 views

Conditions for which $(\sum p_i)(\sum \frac{1}{p_i})$ over an arbitrary $i$ for a set of primes $\{p_i\}$ is unique?

I am looking for conditions (if any are needed beyond properties of primes) for which $(\sum p_i)(\sum \frac{1}{p_i})$ over an arbitrary $i$ for a set of primes $\{p_i\}$ is unique in that there is ...
1
vote
1answer
33 views

Generalizing primality to other operations

(By "number" below I always mean an element of $\mathbb{Z}^+\setminus $$\left\{1\right \}$.) We all know that a number $p$ is prime iff it cannot be represented as $ab$ for any two numbers $a$ and ...
6
votes
1answer
208 views

Can Fermat's little theorem be used to list primes?

I was reading about Fermat's little Theorem, which states that if p is prime, then for any integer a, $a^p-a$ would be a multiple of p. So, I started wondeing if this could be used to determine ...
2
votes
1answer
203 views

Unusual behavior of 210 and 199 regarding prime numbers

Adding 210 to 199 over and over again, you get 8 more primes that can be arranged together into a 3x3 magic square: 1669 199 1249 619 1039 1459 829 1879 409 Is there any other pairs of numbers ...
3
votes
1answer
85 views

Golden Ratio of Primes (Amateur)

Unable to find information elsewhere, so I'll try here. What two consecutive primes are closest to producing the Golden Ratio? Or two of any Primes? Has this been determined? Thanks!
0
votes
1answer
92 views

Computing infinite product over primes

How can I compute $$ \prod_p \left(1+\frac{k}{p}\right)\exp(-k/p) $$ where $0<k<e$ and the product is over all primes $p$? Background L. G. Sathe proved [1] that there are $$ ...
0
votes
2answers
52 views

Dividing a product of different primes by another prime

A relatively straight forward question. If I were to multiple any amount of different prime numbers together say 7*3*11, is it possible to divide the product by a single other prime number say 23 and ...
2
votes
3answers
53 views

Smallest prime factor of a Mersenne number

The Mersenne numbers $M_n$ are integers of the form $2^n-1$, where $n$ is a positive integer. In the case when $n$ is a prime, are there any results known on the smallest prime factor, $p_n$, of ...
1
vote
1answer
33 views

Given a sequence, construct a function whose integral is equal to the sum of the sequence

Let $P_n$ be the sequence of prime numbers, where $P_0=2$. Given $m\in\mathbb{N}$, how can we construct $f(x)$ such that: $\displaystyle\forall{0}\leq{i}\leq{m}:f(i)=P_i$ ...
2
votes
1answer
38 views

A slightly various form of Dirichlet's theorem on arithmetic progressions

Are there infinitely many primes of the form $2n(n+1)+1$?
3
votes
0answers
38 views

Are there infinitely many prime numbers in $a_n=\frac{7\times 10^n-1}{3}$?

In the array $a_n=\frac{7\times 10^n-1}{3}$, are there infinitely many primes? (when $n={7+16k},a_n$ is divisible by $17$, so there are infinitely numbers not prime)
1
vote
1answer
42 views

A different way to solve Chinese remainder theorem

I'm doing my homework about Chinese remainder theorem $x = a_1(\mod n_1)$ $x = a_2(\mod n_2)$ As I know, x can be found by using: $$x=\{\sum_{i=1}^na_iN_i(N_i^{-1}(\mod n_i)) \}(\mod N)$$ with ...
1
vote
4answers
106 views

The fastest way to count prime number that smaller or equal N

I want to count all prime numbers that existing in N but I don't know how to count. Can any one tell me how to count prime numbers that are smaller than or equal to N in mathematics formal?
3
votes
1answer
69 views

Possible Prime Sum Pattern (Amateur)

Disclaimer: I’m an amateur, and have no advanced knowledge of math, so please forgive my ignorance as I’m just curious to know if I’ve stumbled upon something or not. Prime Numbers: 2, 3, 5, 7, 11, ...
6
votes
1answer
142 views

Does $\sum\limits_{n=1}^{\infty}\frac{1}{P_n\ln(P_n)}$ converge to the golden ratio?

The sum $\displaystyle\sum\limits_{n=2}^{\infty}\frac{1}{n\ln(n)}$ does not converge. But the sum $\displaystyle\sum\limits_{n=1}^{\infty}\frac{1}{P_n\ln(P_n)}$ where $P_n$ denotes the $n$th prime ...
3
votes
0answers
80 views

conjecture about prime numbers and distance between them

is there a name for this conjecture? Conjecture: given $p_n$ a prime number sequence where $p_1=2,p_2=3,\cdots$, then for all $n\in\mathbb{N}^*$ and $k\in\mathbb{N}$, holds that $\displaystyle ...