google-deepmind / google-deepmind/formal-conjectures
Erdős Problem 679
Open
ams-11: Number theory
erdos-problems
new conjecture
- Dominant language
- Lean
- Stars
- 1.3k
- Forks
- 485
- Avg merge
- 1d 20h
- Merged PRs (30d)
- 328
Description
### What is the conjecture
https://www.erdosproblems.com/679
Let $\epsilon>0$ and $\omega(n)$ count the number of distinct prime factors of $n$. Are there infinitely many values of $n$ such that
$$\omega(n-k) < (1+\epsilon)\frac{\log k}{\log\log k}$$
for all $k
Contributor guide
Assessment
This issue has not been assessed yet.