google-deepmind / google-deepmind/formal-conjectures

Erdős Problem 935

Open
#1,027 1 comment 0 reactions 0 assignees View on GitHub
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/935

For any integer $n=\prod p^{k_p}$ let $Q_2(n)$ be the powerful part of $n$, so that
$$Q_2(n) = \prod_{\substack{p\\ k_p\geq 2}}p^{k_p}.$$
Is it true that, for every $\epsilon>0$ and $\ell\geq 1$, if $n$ is sufficiently large then
$$Q_2(n(n+1)\cdots(n+\ell))

Contributor guide

Open the contributing guide

Assessment

This issue has not been assessed yet.

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.