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

3
votes
0answers
22 views

Number of lucky primes

The "lucky numbers" can be constructed with this sieve. The red ones are the lucky numbers. As you can see, some are prime. Is the number of lucky primes infinite? Edit: Apparently this is an open ...
3
votes
0answers
28 views

An inequality on the series of powers of reciprocals of the primes

Let $p_n$ denote the $n$-th prime $(p_1=2)$ Let $s>1$ Prove that $\displaystyle-1+\ln(\frac{s}{s-1})\leq\sum_{k=1}^\infty\frac{1}{p_k^s}\leq\ln(\frac{s}{s-1})$ Using the classical ...
1
vote
0answers
11 views

Special $\omega(n)$-sequence

Let $k$ be a natural number, $\omega(n)$ the number of distinct prime factors of $n$. The object is to find a number $n$ with $\omega(n+j)=j+1$ for each $j$ with $0\le j\le k-1$. In other words, a ...
3
votes
3answers
38 views

Is there a counterexample? $\forall\ p \gt 3 \in \Bbb P, (number\ of\ Quadratic\ Residues\ mod\ kp)=p\ when\ k\in\{2,3\}$

I have started to learn about the properties of the quadratic residues modulo n (link) and reviewing the list of quadratic residues modulo $n$ $\in [1,n-1]$ I found the following possible property: ...
0
votes
2answers
36 views

Pattern for generating primes and semiprimes?

First, is there a formula that can generate semiprimes in polynomial time? Also, I found this interesting pattern: $$3x+1, 3x+2$$ Inputting increasing natural x spits out $$7, 11, 13, 17, 19, 23, 25, ...
0
votes
1answer
63 views

Brain-explosion pattern of primes and the number 30? [on hold]

Prime numbers. Elusive little snips. They give you a warm trail with a dead end. Here's another one of those pattern 'trails': $$30$$ Normal number? How about 'expanding' outward? $$29, 30, 31$$ Yea, ...
33
votes
4answers
2k views

Eyebrow-raising pattern of number of primes between terms of the Fibonacci number sequence?

So, $$1,1,2,3,5,8,13,21...$$ Any connection to primes?...it appears not. However, in between the Fibonacci numbers are how much primes? Let's see: 1 and 1 ZERO 1 and 2 NADA 2 and 3 ZILCH 3 and 5 ZIP ...
5
votes
2answers
69 views

Inifinitely many primes $p\equiv -1 \mod12$

I haven't been able to prove this statement from my Elementary Number course: There are infinitely many primes $p$ such that $p\equiv -1 \mod12$. From here I know that there exists a "Eulcidean ...
0
votes
0answers
56 views

Is $74*2^n - 1$ prime for some $n$?

Hello I could not find google´s answer for this one, and my computer became ill when reached $n = 1300$ (I hope did n´t some mistake), but some clever people said to me yes, there is $n$ where this ...
5
votes
1answer
76 views

theorem relating mersenne numbers?

For $(x2^9)^2=2^q-1+y^2q^2$,where $q$ is prime, is it possible to show that there exists only an unique solution for the pair $\{x,y\}$?
4
votes
1answer
39 views

Number of primes between $2k$ and $(\sqrt{k}-1)^2$.

I would like to prove the following. Let $\pi$ denote the prime counting function. Then for $k\geq 81$ we have $$ \pi(2k)-\pi\left(\left\lfloor(\sqrt{k}-1)^2\right\rfloor\right)\geq 6. $$ What I ...
1
vote
3answers
58 views

Find $y$ satisfying $17y = 1 \mod (130)$

Let $x=17$ $n=130$. Find $y; (1\leq y \leq n-1)$ that satisfies :$$xy=1 \pmod n$$ Now I'm not sure if I should use one of Euler's theorem's for prime numbers? Can anyone help? Or try something with ...
-4
votes
1answer
63 views

Prove that for all prime numbers [duplicate]

Prove that for all prime numbers $p>2000$ the sum $1 + 2\cdot2000 + 3\cdot2000 + … + (p-1)\cdot2000$ is divisible by $p$.
6
votes
2answers
412 views

Number theory, prime numbers

prove that for all prime numbers $p>2000$ the sum $$1+2^{2000}+3^{2000}+...+(p-1)^{2000}$$ is divisible by $p$ I tried this with primes smaller then $2000$, but I can't find a general rule.
3
votes
0answers
70 views

Help with the results of a test about the distances between primes

I did the following test: For every prime, take the distance $dp$ to the previous prime and the next prime $dn$, then calculate $a=(pp\ mod\ dp)$ and $b=(np\ mod\ dn)$. If $a$ or $b$ $\in \Bbb ...
4
votes
1answer
45 views

Sum of reciprocals of primes diverges

I can show that $$\log(\zeta (s)) = \sum _{p\in\Bbb P} \frac{1}{p} + R(s)$$where $$R(s) = \sum _{m\geq 2} \sum_{p\in\Bbb P} \frac{1}{m} \frac{1}{p^{ms}}$$ where $\Bbb P$ is the set of all primes, ...
0
votes
1answer
37 views

Find the lowest value of $x$ so that $x \in (A \setminus B)$

Let $A$ and $B$ be two sets for which the following applies: $A = \{x: \text{GCD(}x,12) = 1\}$ $B = \{x: x\ \text{is a prime}\}$ Find the lowest value of $x$ so that $x \in (A \setminus B)$. $x \in ...
2
votes
1answer
64 views

Can the expression $6^{2n} - 25$ be a prime for all $n \geq 2$?

Can the expression $6^{2n} - 25$ be a prime for any $n \geq 2$? My attempt to solve the problem: No, it cannot. $6^{2n} - 25 = (6^{n})^{2} - 25 = (6^{n})^{2} - 5^{2} = (6^{n} + 5)(6^{n} - 5)$ And ...
2
votes
1answer
31 views

for which values of the pair of integers $(n,k)$ is $p(n,k) =1+\frac{2^{k}-1}n$ is prime?

let $p(n,k)= 1+\frac{2^{k}-1}{n}$ for a positive integer $n,k$ -for which values of the pair of integers $(n,k)$ : $p(n,k)$ is prime ? Any help is very welcom .Thank you
0
votes
2answers
90 views

How to find the greatest prime number that is smaller than $x$? [duplicate]

I want to find the greatest prime number that is smaller than $x$, where $ x \in N$. I wonder that is there any formula or algorithm to find a prime ?
1
vote
0answers
20 views

Is there a match between this modified prime pi function and the Log integral function?

Table T is defined as through the properties that accumulated row sums give prime numbers, while accumulated column sums give composite numbers. ...
1
vote
0answers
42 views

Is the Ulam Spiral just a coincidence?

I was messing around with the Ulam spiral because I was a little skeptical on it having any actual relevance. I noticed that if you lay out the spiral and then circle all the even numbers, it displays ...
2
votes
1answer
26 views

Cyclic consecutive zeros of binary sequence with prime length

I found a feature that if $N>5$ is a prime, and $M \triangleq \frac{N-1}{2}$ is also a prime, then we will always have a binary sequence $x_1,\ldots, x_N$ with $L=\frac{N-1}{2}$(or ...
2
votes
2answers
90 views

Prove an inequality of Prime Numbers

The problem on which I am currently stuck is, Is it true that, $$x+y< \dfrac{p_{\pi(x)}+p_{\pi(y)}+p_{\pi(x)+1}+p_{\pi(y)+1}-2}{2}$$ for all sufficiently large $x$ and $y$, $x+y$ is a prime ...
0
votes
1answer
23 views

Set theory, intersection of two sets

We have the set $D$ which consists of $x$, where $x$ is a prime number. We also have the set F, which consists of $x$, belongs to the natural numbers (positive numbers $1, 2, 3, 4, 5,\dots$) that is ...
0
votes
1answer
53 views

Least pair of numbers having at least $k$ distinct prime factors

Consecutive numbers with less than $k$ prime factors? shows that for every $k$, there is a pair $(n/n+1)$, such that $n$ and $n+1$ both have at least $k$ distinct prime factors. The object is to ...
3
votes
1answer
63 views

Has this approximation $0.41468250985111166$ a name?

William Hughes calculated on WolframAlpha the expression $$ \sum_{n=1}^{\infty} \frac{1}{2^{\operatorname{prime}(n)}} $$ and got the approximate value $0.41468250985111166$. If one enters this value ...
2
votes
1answer
31 views

How to show the existence of an ideal in the ring of Gaussian integers that satisfy the following?

How to show that If $p$ is a prime and $p\equiv1\bmod4$ then there exists an ideal of the $R=\mathbb{Z}[i]$, the ring of Gaussian integers, such that $R/I$ is isomorphic to ...
1
vote
0answers
42 views

Primes with the first $k$ digits of the solution of the equation $e^{-x^2}=x$

Let $s$ be the solution of the equation $e^{-x^2}=x$ The first $1000$ digits are : ...
2
votes
1answer
19 views

Sequences formed by integer evaluations of polynomials modulo $ p^{k} $, where $ p $ is a prime number and $ k \in \Bbb{N} $.

I have the following question. Let $ p $ be a prime number and $ k $ a positive integer. Let $ (a_{n})_{n \in \Bbb{Z}} $ be a two-way sequence in $ \Bbb{Z} / p^{k} \Bbb{Z} $. Then is it true that ...
1
vote
1answer
33 views

A Problem on the Prime Counting Function $\pi(x)$

Let $\pi(x)$ denotes the number of primes less than or equal to $x$. Also suppose that for some fixed $N$ we have $\pi(x+y)\ge\pi(x)+\pi(y)$. The problem is, Show that the equality in the above ...
0
votes
0answers
23 views

Primality radius and quadratic reciprocity law

Given an integer $n>1$, I say that $r$ is a primality radius of $n$ if both $n-r$ and $n+r$ are primes. Goldbach's conjecture asserts that every integer greater than $1$ admits a primality radius. ...
3
votes
2answers
61 views

Set and subsets link by prime numbers

I have a bit idea to solve this problem for small $n$ by programation but I think for $n>100$ I will need maths to help me. My problem is : Let S be the set of prime numbers less than n. Find ...
4
votes
0answers
40 views

Number of squarefree numbers and the Basel problem

Who discovered/proved that there are about $$ \frac{x}{\zeta(2)} $$ squarefree numbers up to $x$, or (roughly) when was this first known? Today I think this is considered 'obvious', but I don't know ...
1
vote
1answer
37 views

Mathematical terminology for primes $(q+1)/2$ such that $q$ is also prime

So I know that if both $p$ and $2p + 1$ are primes, then $p$ is a Sophie Germain prime from the Prime Glossary. My question is this: How do we call a prime $r=(q+1)/2$ such that $q=2r-1$ is also ...
4
votes
2answers
44 views

A Mertens-like product over primes

MathWorld's page Prime Products gives the 'related result' (7) to Mertens' theorem: $$ \lim_{n\to\infty}\log p_n\prod_{k=1}^n\frac{1}{1+1/p_k}=\frac{\pi^2}{6e^\gamma}. $$ Does this identity have a ...
3
votes
2answers
44 views

$\forall n\ /\ \not\exists$ {primitive roots modulo n}: if $\ Max(ord_n(k))+1 \mid n\ $ then $\ Max(ord_n(k))+1\ $ is prime?

When a number $n$ does not have primitive roots modulo n, $Pr(n)$, it is possible to generate the set $M$ of those numbers $m$ whose order $ord_n(m)$ is the maximum multiplicative order of $k$ in ...
25
votes
3answers
2k views

How to force prime numbers into a line?

Inspired by an article on Prime Spiral and Hough transform I tried to analyze patterns created by plotting numbers on spiral (Archimedean?). $$x = \cos( angle ) * radius$$ $$y = \sin( angle ) * ...
0
votes
0answers
16 views

system of congruency prime solutions

If you have a system of congruency and you have the solution space. Is there criteria to determine if there is a prime in the solution space and if yes is there a better way to find them instead of ...
0
votes
1answer
30 views

If $N\equiv 1\pmod 4$ does then follow that $p\equiv q\equiv 1\pmod 4$

$N = pq$ is the product of two primes. If $N\equiv 1\pmod 4$, does then follow that $p\equiv q\equiv 1\pmod 4$ ?
3
votes
1answer
29 views

Matrix with prime entries and largest possible determinant

Let $n\ge 1$ be a natural number. Arrange the first $n^2$ primes in a $n\times n$-matrix, such that the determinant becomes as large as possible. What is the largest possible determinant and which ...
2
votes
2answers
98 views

Special representation of a number

How can I check, if a number $n$ can be representated by $$pq+rs$$ where $p,q,r,s$ are pairwise different prime numbers with the same number of digits. For example, $$105153899965560312960 = ...
4
votes
1answer
49 views

Is there a counterexample? $\forall p \in \Bbb P\ ,\ p\gt 61\ ,\ \exists\ r1,r2\ \in \{\ Primitive\ Roots\ Modulo\ p\ \}\ /\ r1+r2 = NextPrime(p)$

This is the weirdest thing I have observed so far! Take the set of Primitive Roots Modulo p (link to definition here) of a prime number $p$, $Pr(p)$. For those primes $p \gt 61$ there is always a pair ...
0
votes
0answers
21 views

Counting the number of elements $x$ between $p$ and $p^2$ where lpf$(x(x+2))=7$

Let $p > 7$ be any prime. Let $f_7(p)$ be a function that counts the number of elements $x$ where $p < x < p^2$ and lpf$(x(x+2))=7$ where lpf is the least prime factor. It has been ...
3
votes
0answers
114 views

Conjecture concerning sums of reciprocals of largest prime factors

Let $x$ be an integer, $r(x)$ the reciprocal of the largest prime factor of $x$. Let $f(n) = \sum_{k=1}^{n-1} r(k) r(n-k)$ for which $k$ and $(n-k)$ are coprime. For $n = 3 \dots 10$, $f(n) = ...
1
vote
4answers
56 views

Prove or disprove $\frac{\left(2^{p}-2\right)}{p}\ \in \Bbb N, \forall\, p,\, prime$

Apologies in advance for poor formatting, not completely accustomed to typeset. What I ask is any non-particular value p, with one condition that it is prime, for which to disprove the following ...
-6
votes
3answers
117 views

Is this the real reason why 1 is not prime? [duplicate]

Divisibility by 1 is misleading as it does not divide a number into smaller parts. If divisibility by 1 is disallowed, then: The Unit: A whole number that is indivisible. Prime: A whole number that ...
3
votes
1answer
51 views

Is this reasoning correct for average prime gap?

Since \begin{align} &\operatorname{li}(n)\sim\Pi (n)\equiv\sum _{k=1}^{\lfloor \log (n)\rfloor } \frac{\pi \left(n^{1/k}\right)}{k}\\ \end{align} then the average gap for \begin{align} ...
0
votes
0answers
46 views

Solve an equation of the prime counting function

The problem is, Find all the positive integral values of $x$ for which we have, $$\pi(p_n-x)=\pi(p_{n+1}-x-1)$$where $\pi(x)$ denotes the number of primes not exceeding $x$. I don't know where ...
0
votes
1answer
30 views

Notation about factors

What is the name (if there is one) of the "full factorization representation" of a number, in which also the powers of the factors are (recursively) decomposed until all the numbers used in the ...