Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with prime-numbers
Search options not deleted
user 127690
Questions where prime numbers play a key-role, such as: questions on the distribution of prime numbers (twin primes, gaps between primes, Hardy–Littlewood conjectures, etc); questions on prime numbers with special properties (Wieferich prime, Wolstenholme prime, etc.). This tag is often used as a specialized tag in combination with the top-level tag nt.number-theory and (if applicable) analytic-number-theory.
5
votes
The smallest solution to $2^{2k}-1=\text{powerful}$
Note that if there are only finitely many non-Wieferich primes, then that would imply that there is such a $k$. If there were only finitely many non-Wieferich primes, one could make a sequence based o …
- 3,065
30
votes
Why is integer factoring hard while determining whether an integer is prime easy?
In the particular case of primality testing, primality testing is easier than factoring mainly because $p$ is prime if and only if $\mathbb{Z}/p\mathbb{Z}$ forms a field. This has a lot of consequence …
- 50.7k
3
votes
Accepted
Number of distinct near-squares primes dividing an odd perfect number
In general, very few prime factors in an odd perfect number can be of the form $n^2+1$.
In particular, if N is an odd perfect number then $\frac{\sigma(N)}{N}=2$, and for any $m$ (perfect or not), $\f …
- 7,089
6
votes
Is such a generalization of the twin prime conjecture known?
As written, this is hopeless false. $(2,3)$ is an obvious counterexample. Slightly less trivially, $(3,5,7)$ is a counterexample.
One can correct for these, and if one does so, one gets a version of t …
- 12.9k
4
votes
2
answers
360
views
A specific Diophantine equation restricted to prime values of variables.
Consider the following Diophantine equation $$x^2+x+1=(a^2+a+1)(b^2+b+1)(c^2+c+1).$$ Assume also that $x,a,b,c,a^2+a+1,b^2+b+1, c^2+c+1$ are all primes. We'll call such a quadruplet $(x,a,b,c)$ a trip …
- 7,089
3
votes
Accepted
A specific Diophantine equation restricted to prime values of variables.
Pace Nielsen and Cody Hansen just put this preprint on the Arxiv which shows that no triple threats exist.
- 7,089
3
votes
Twin Mersenne exponent conjecture
As Wojowu notes in their comment, given the state of the art, we can't even prove that there are infinitely many primes $p$ where $M_p$ is composite. That said, standard heuristic arguments support th …
- 7,089
4
votes
Accepted
New experiments involving Ramanujan primes: Benford's law
If I am following what is being asked, the answer is no.
Set $R$ to be the set of Ramanujan primes. Let $R_d$ be the set of Ramanujan primes with lead digit $d$. For a set of positive integers integer …
- 7,089
10
votes
Are there infinitely many $n$ such that $n!-1$ and $n!+1$ are prime numbers?
Almost certainly not. But note that if it were true, proving it would be extremely tough. We can't even prove now that there are infinitely many primes of the form $n!+1$ or that there are infinitely …
- 7,089
5
votes
1
answer
344
views
Quadratic Diophantine equations with all values prime
Given a quadratic Diophantine equation over the integers in two variables, can we say much about when it has only finitely many solutions with the additional assumption that both variables are prime?
…
- 25.7k
1
vote
On the maximal power of $2$ that divides a colossally abundant number
The following gives a very weak bound. Set $h(n) = \frac{\sigma(n)}{n}$, and $$H(n) = \prod_{p|n} \frac{p}{p-1}.$$ Note that it is not hard to show that $h(n) \leq H(n)$ with equality if and only if …
- 7,089
4
votes
Is every integer $\ge 312$ the sum of two integers with triangular divisors?
Not a complete answer, but it made sense I think to summarize the comment thread above:
Theorem: Every sufficiently large positive integer is expressible as a sum of three numbers which have triangul …
- 7,089
3
votes
Accepted
p2 - p1 = 2n for every 2n
The two relevant papers for Chen's original proof are Chen, J.R. (1973). "On the representation of a larger even integer as the sum of a prime and the product of at most two primes". Sci. Sinica. 16: …
- 7,089
7
votes
Accepted
The equivalent proposition of Legendre's conjecture
Your conjecture for sufficiently large $n$ is implied by Cramer's conjecture. In general though, conjectures like this unless they are coming from some specific application aren't that interesting. It …
- 7,089
10
votes
Accepted
Error term in Mertens' third theorem
There's been a lot of work on unconditional results of this sort.
Rosser and Schoenfeld showed in a 1962 paper that one can take
$$\dfrac{e^{-\gamma}}{\log x} \left(1- \frac{1}{2\log^2 x} \right) < …
- 18.7k