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

2
votes
0answers
28 views

Are minus-primorial-primes rarer than plus-primorial primes?

Here https://primes.utm.edu/glossary/page.php?sort=PrimorialPrime it can be seen that the largest known primorial prime of the form $p\#-1$ is far smaller than the largest known primorial prime of ...
2
votes
0answers
44 views

Is $49931$ the least positive integer $k$, such that $312^{4009}+k$ is prime?

Denote $$z(k)\ :=\ 312^{4009}+k$$ After a long search, I found the (probable) prime $z(49931)$. Questions : $1)$ Is $k=49931$ the least positive integer, such that $z(k)$ is prime ? ...
2
votes
0answers
46 views

How to calculate the $n$ prime from $\pi (n)$?

Assume we had an exact formula for $\pi (n)$, how could we get from that formula an exact expression for the $n$th prime? I tried looking at approximations we have of $\pi (n)$ like $\frac {n}{\ln ...
2
votes
0answers
146 views

On n! divided by a product of primes and related questions

We have the following Definition 1. For integers $n\geq 1$ we define $$f(n) = \begin{cases} 1, & \text{if $n=1$} \\[2ex] \frac{n!}{\prod_{p\leq n}p}, & \text{if $n>1$} ...
2
votes
0answers
52 views

Conjectured new primality test for Mersenne numbers

How to prove that this conjecture about a new primality test for Mersenne numbers is true ? Definition: Let $M_{q}=2^{q}-1 , S_{0} = 3^{2} + 1/3^{2} , \ and: \ S_{i+1} = S_{i}^{2}-2 \pmod{M_{q}}$ ...
2
votes
0answers
72 views

Legendre symbol identity

I try to solve the following problems ($p$ is an odd prime) Find the sum $$\sum_{a=1}^{p-1}a \cdot \left (\frac{a}{p} \right)$$ Find the sum $$\sum_{a=1}^{p-1} 2^a \cdot \left (\frac{a}{p} \right)$$ ...
2
votes
0answers
39 views

Finding primes using the Fibonacci sequence in modular form

I was wondering if the following is already a known result in mathematics. I have tested it and it seems to work every single time. If I write the Fibonacci sequence in $\bmod (a)$ form and it ...
2
votes
0answers
47 views

Prime from mirror concatenation of first primes

The mirror concatenation of the first 1, 6 and 8 prime numbers with no primes being reversed is a prime ! i.e. 131175323571113 and 19171311753235711131719 are prime numbers! (beautiful primes!). After ...
2
votes
0answers
65 views

Greatest prime factor of $\left(\dfrac{n(n+1)}{2}\right)^2-1$.

Consider $$ \left(\dfrac{n(n+1)}{2}\right)^2-1. $$ Is is possible to say something about the lower bound on the greatest prime divisor of the above expression depending only on $n$? I surfed through ...
2
votes
0answers
22 views

Generalization of a Result Concerning Projective Planes

Let $\mathcal P$ denote the set of all possible orders of projective planes. For $q\in\mathcal P$, let $PG_2(q)$ denote the projective plane of order $q$. There is a theorem due to James Singler ...
2
votes
0answers
204 views

Does the Euler product for the Dirichlet $\beta$-function converge for all $\Re(s)>\frac12$?

The Dirichlet $\beta$-function is defined for $\Re(s)>0$ as: $$\beta(s) = \sum_{n=0}^\infty\frac{(-1)^n}{(2n+1)^s}$$ It has the following Euler product (I used that Dirichlet character ...
2
votes
0answers
88 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
0answers
40 views

How many entries in the sequence $x_n$ given by recursion $x_1=1\ ,\ x_{n+1}=p_{x_n}$ are known?

The sequence $x_n$ with the recursion $x_1=1\ ,\ x_{n+1}=p_{x_n}$ , where $p_k$ denotes the $k-th$ prime, has the following values : ...
2
votes
0answers
30 views

If $q$ is a prime, $gcd(x(x+2),q\#)=1$ and $q < x < q^2$, doesn't it follow that $x,x+2$ are twin primes?

I recently asked a question that was not well received. That's ok. I don't disagree with the ratings if my question is unclear. I want to verify the foundation of my reasoning. Doesn't it follow ...
2
votes
0answers
40 views

Prove an inequality of composite numbers

Yesterday after reading this post I tried to prove the inequality as given in the post. The inequality is, $$c_m+c_n>c_{m+n}$$ for all $m,n\ge1$. The problem was regarding the following special ...
2
votes
0answers
55 views

A multivalued function $ f(x) = 0 $ with integer solutions $ x_1=p(n) $ and $x_2=q(n) $

Please help me to define a multivalued function $ f(x) = 0 $ with integer solutions : $ x_1 = p(n)$ and $ x_2 = q(n) $ such that $\dfrac{ p(n) + q(n) } { 2 } = 2 n + 1 $ and $ ...
2
votes
0answers
39 views

lattice walks with primes and composites

In the regular square lattice create a walk moving according the value of a counter. Consider two types of walks: In the first walk advance forward one unit if the counter is a composite number and ...
2
votes
0answers
37 views

The name given to the number 1 in the context of Primes and Composites

We give names to the sets of numbers called Primes and Composites. Is there a name for the number 1, in this context, seeing it is neither a Prime or Composite?
2
votes
0answers
34 views

Prime distribution around Riemann counting function

Is it true that the primes are normally distributed around the Riemann counting function $R(n)$ as a folded CDF? (Scaled $p_n-R(n)$)
2
votes
0answers
53 views

Question about the Chinese Remainder Theorem and the residue class ring ${\bf Z}/p\# {\bf Z}$

In a question that I asked on MO, Terence Tao observed that: The Chinese Remainder Theorem tells us that the residue class ring ${\bf Z}/p\# {\bf Z}$ is isomorphic (as a ring) to the product of ...
2
votes
0answers
193 views

Numbers $717, 71717, 7171717,\dots$ and primality

Prove or disprove that all numbers $717, 71717, 7171717,\dots$ are composite. This is related to this question. $\begin{array}\\ 717 &= \text{div by 3}\\ \color{blue}{71717} &= 29\cdot ...
2
votes
0answers
21 views

Solution to a set of number theoretic constraints

I'm trying to prove a graph theoretic lemma for my research; I need to construct graph homomorphisms between some delicately defined graphs. I believe I can do this if (and maybe only if) I can find ...
2
votes
0answers
73 views

Is there a strong version of twin prime conjecture?

The twin prime conjecture states that : There exists infinitely many integers such that $n$ and $n+2$ are both primes for a fixed $k$, can we find integers $a_1,a_2,\cdots, a_k$ such that: ...
2
votes
0answers
196 views

Primality Test for $N=2\cdot 3^n-1$

Definition Let $P_m(x)=2^{-m}\cdot \left(\left(x-\sqrt{x^2-4}\right)^{m}+\left(x+\sqrt{x^2-4}\right)^{m}\right)$ , where $m$ and $x$ are nonnegative integers . Conjecture Let $N=2\cdot 3^n-1$ such ...
2
votes
0answers
85 views

Count of lower and upper primitive roots of prime $p \equiv 3 \bmod 4$

I was exploring the layout of primitive roots of primes over a reasonable range and this question concerns the number of primitive roots either side of $p/2$. Many primes have an exact match between ...
2
votes
0answers
54 views

Convergence of recurrence relation involving divisors

I$\let\leq\leqslant\let\geq\geqslant$ thought up a family of sequences, recursively defined by $$a_{n+1}=\frac{d_n^ra_n+a_{d_n}}{d_n^r+1}\quad(n\geq2)$$ where $r,a_1,a_2\in\mathbb R$ are parameters ...
2
votes
0answers
49 views

Numbers $m,n$, such that $a^m+ab+b^n$ is always composite

Are there integers $m,n\ge 2$, such that $$a^m+ab+b^n$$ is composite for all integers $a,b\ge 2$ ? I checked the pairs with $2\le m\le 100$ and $2\le n\le 100$ and always found a prime of the form ...
2
votes
0answers
60 views

Multiplication Sieving

Background I made another improvement to Fermat's sieve factorization, by merging the sieves groups of $4,3,5,7,11,13,17$ in two one big group. This method allows me to reduce the values that I need ...
2
votes
0answers
42 views

Proof of an inequality about primes

I'm very new to number theory and looking for a proof of the following inequality: $$c' \log^{\text{#} \mathbb{P}}{R} \leq \sum \limits_{\substack{n \leq R\\p|n \implies p \in \Bbb P}} 1 \leq c ...
2
votes
0answers
37 views

Is an upper bound known for the least exponent $k$ such that $(\pi(n^k)-\pi(n))_{n=1}^\infty$ is strictly increasing?

Is an upper bound known for the least exponent $k$ such that $(\pi(n^k)-\pi(n))_{n=1}^\infty$ is strictly increasing? It appears that the sequence is strictly increasing when $k\geq2$, but ...
2
votes
0answers
113 views

Question regarding the prime factors of $2^{35} - 1$

Question regarding the prime factors of $2^{35} - 1$ I just wanted to make a few things clear; 1) It is true to state that this cannot be a Mersenne prime (A number of the form $2^r - 1$ where ...
2
votes
0answers
52 views

Determine whether permutation of the digits of a number is prime

Given a number $m$ in decimal representation. I want to find a permutation of the digits of $m$, so it is prime. (Or output that there exists none) Do i have in the worst case check every possible ...
2
votes
0answers
91 views

$f(x)\sim 1/x \implies (1+f(x))^x\to e$, but what family of functions maximizes the speed of convergence from below?

This problem is subordinate to finding out if $$\left(1+\frac{\log p_{n+1}}{p_n}\right)^{p_{n+1}/\log p_n},$$where $p_n$ is the $n$-th prime, never stabilizes above or below its limiting value, which ...
2
votes
0answers
92 views

Riemann's explicit formula for $\pi(x)$

Riemann's explicit formula $J(x)=\mathrm{Li}(x)-\sum_{\Im\varrho>0}\left(\mathrm{Li}(x^\varrho)+\mathrm{Li}(x^{1-\varrho})\right)+\int_x^\infty\frac{\mathrm{d}t}{t(t^2-1)\log t}-\log2,$ where ...
2
votes
0answers
38 views

Is there is any result claiming that there cannot be any other twin Mersenne primes?

There are 3 known Twin Mersenne Primes: $M3$ and $M5$, $M5$ and $M7$, $M17$ and $M19$. More precisely, if both $M(p)$ and $M(p+2)$ are both prime, then they are called Twin Mersenne Primes. My ...
2
votes
0answers
85 views

Does this formula always yield a prime?

Somehow $\tau=1.2516475977905$ appears to have the property that $$ \left\lfloor 2^{2^{{\,}^{\cdot^{\cdot^{\cdot^{\tau}}}}}}\right\rfloor $$ is always a prime. Here $\lfloor x\rfloor$ denotes the ...
2
votes
0answers
92 views

Largest prime factor of a Mersenne number with exactly two prime divisors

For a prime $p$, let $M_p = 2^p-1$ be a (Mersenne) number with exactly two prime divisors, and let $P(p)$ be the largest of these two. Clearly $P(p) > \sqrt{M_p}$. This is very likely a hard ...
2
votes
0answers
62 views

multiples (of primes) coverage formula

I apologize in advance if my explanation is not clear. Please let me know if clarification is required and I will do my best to fix it! I am attempting to find an explicit formula (in terms of ...
2
votes
0answers
34 views

Proof without using the proof of contradiction

By using the proof by contradiction I can determine that the root of a prime number is irrational. But how can I proof this by using the rational roots test to find rational factors of $x^n - p$. How ...
2
votes
0answers
78 views

A similar, but hopefully easier problem than Gilbreath's conjecture

Gilbreath's conjecture says that for every positive integer $n$, if we write out the first $n$ primes $2,3,5,7,11,13,\ldots,p_n$ take the differences between consecutive terms ...
2
votes
0answers
85 views

Prime Factor Problem To Solve

For any positive integer $n>10$, $\lfloor \sqrt{n!}\rfloor$ has always a prime factor $> n$.
2
votes
0answers
45 views

$x^5+a$ is reducible in $\mathbb{Z}_5[x]$ for each $a\in\mathbb{Z}_5$

Question: Show that $x^3+a$ is reducible in $\mathbb{Z}_3[x]$ for each $a\in\mathbb{Z}_3$, and that $x^5+a$ is reducible in $\mathbb{Z}_5[x]$ for each $a\in\mathbb{Z}_5$ So I got these two as my ...
2
votes
0answers
148 views

Inequality with Euler's totient function

In A conjecture concerning primes and algebra on MSE, I defined a multiplicative function $\omega:\mathbb Z_+\!\!\to\mathbb Z_+$ with $\omega(p_n)=n$, for the $n$-th prime $p_n$. It was conjectured ...
2
votes
0answers
90 views

Humankind knows the prime factorization of the first how many consecutive integers?

I am only looking for an approximation. I'm guessing the answer must be somewhere between $10^{20}$ and $10^{50}$. . Edit: Okay so my first initial estimation was pretty poor... I should have ...
2
votes
0answers
81 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 ...
2
votes
0answers
40 views

Significance of formulas similar to summation formula

We all know formula $n(n+1)/2$ for adding up the numbers from $1$ to $n$. But I would like to know if there is any significance and use of formulas of type $n(n^{p-1}+p-1)/p$, where $p$ is a prime. ...
2
votes
0answers
63 views

The Existence of “Simple” Prime Generating Functions

Obviously, we do not know an explicit and easily manipulable formula for finding every prime - that is, a function $f(n)$ which yields the $n^{th}$ prime. I've seen plenty of formulas that "cheat" in ...
2
votes
0answers
39 views

Does a random binary sequence almost always have a finite number of prime prefixes?

Does a random binary sequence almost always have a finite number of prime prefixes? Specifically, let $x = \sum_{1 \le i}{2^{-i} \cdot x_i}$ with $x_i \in \{0,1\}$ be a random real in $[0,1)$, $X_i = ...
2
votes
0answers
145 views

Are there infinite many primes p such that 2p-1 is also prime?

I did a search online and found a similar notion called Sophie Germain prime, which by definition is a prime $p$ such that $2p+1$ is also prime. Sophie Germain primes are conjectured to be of infinite ...
2
votes
0answers
42 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)