All Questions
12 questions
4
votes
0
answers
266
views
How dense are quotients of smooth numbers?
As usual, call a positive integer $y$-smooth if it has no prime factors greater than $y$. Write $S(x,y)$ for the set of $y$-smooth integers $\leq x$. Write $R(x,y)$ for the set of quotients $\{a/b: a,...
1
vote
0
answers
128
views
Effective Erdős–Kac theorem
I have some number $N$ and some integer $k>0$. I want to know what fraction of numbers up to $N$ have more than $k$ prime factors. (In my application, with repetition, but the $\omega$ version is ...
2
votes
0
answers
70
views
Twin prime distribution centering twice a semiprime
What is the conjectured distributional behavior of semiprimes $pq$ ($p$ and $q$ are primes) having the property $2pq+1$ and $2pq-1$ are primes?
1
vote
0
answers
65
views
Distribution of number of prime factors of $p^k\pm1$
What is the behavior of number of prime factors of integers of form $p^k\pm1$ where $p$ is a fixed odd prime or $2$ and $k$ varies over positive integers?
1
vote
0
answers
96
views
Smooth number pairs satisfying a congruence
Let $\mathcal P=\{p_1,\dots,p_{2t}\}$ be $2t$ primes between $2^\ell$ and $2^{\ell+1}$ and fix an exponent bound $a\in\mathbb Z_{\geq2}$.
Fix $N\in\mathbb N$ whose prime factors $p$ satisfy $p>2^{\...
3
votes
0
answers
323
views
If $p^2 - q^2$ is a perfect square where $p$ and $q$ are primes $> 5000$ then is one of its prime factors always greater than $17$? [closed]
Is it true that if $p^2 - q^2$ is a perfect square where $p$ and $q$ are primes $> 5000$ then it has a prime factor greater than $17$?
Note: This question was asked in MSE but did not receive an ...
20
votes
1
answer
2k
views
Circle $x^2 + y^2 = n!$ doesn't hit any lattice points for any $n$ except for $0$, $1$, $2$ and $6$ or does it?
I stumbled across the following problem in high school:$$
x^2 + y^2 = n!
$$
I tested it within my laptop capabilities, watched a 3b1b video Pi in prime regularities, where he explains how to find the ...
1
vote
1
answer
144
views
Factoring with partial information on gaps
If $N=PQ$ is a semi-prime with $P=N^{\frac12 +\delta}$ and $Q=N^{\frac12-\delta}$ then if we know $\delta\in(0,\frac12)$ to a reasonable precision we can factor $N$ quickly. What precision (number of ...
7
votes
1
answer
382
views
$\log \log p / \log \log n$, where $p|n$, gets equidistributed in [0,1] (for almost all $n$)
According to Hardy-Ramanujan/Erdős-Kac we know that usually there are $\sim\log\log n$ prime numbers in a factorization. But if you pick up a natural number at random, and you factor it, what is the ...
0
votes
1
answer
184
views
Upper bound for tuple of exponents of prime factorization
Let $a(n)$ be the $k$-ary tuple of the exponents of the prime factorization of $n$. For example,
$$a(5184)=a(2^{6}⋅3^{4})=(6, 4), a(65536)=a(2^{16})=(16).$$
Formally, let $p_{1}^{a_{1}}, p_{2}^{a_{2}...
2
votes
1
answer
332
views
Upper bound for product of exponents of prime factorization
Let $p(n)$ be the product of the exponents of the prime factorization of $n$. For example,
$$p(5184)=p(2^{6}\cdot 3^{4})=24,\qquad
p(65536)=p(2^{16})=16.$$
Is $p(n) = O(\log^{k}(n))$ for some constant ...
7
votes
1
answer
1k
views
Results on the largest prime factor of $2^n+1$
A work of Cameron Stewart (the paper has appeared in Acta Mathematica), proving a conjecture of Erdos, Stewart shows that
the largest prime factor of $2^n-1$ is at least
$n \times \exp\Big( \frac{\...