Erdős Problem 380

### What is the conjecture

https://www.erdosproblems.com/380

We call an interval $[u,v]$ 'bad' if the greatest prime factor of $\prod_{u\leq m\leq v}m$ occurs with an exponent greater than $1$. Let $B(x)$ count the number of $n\leq x$ which are contained in at least one bad interval. Is it true that
$$B(x)\sim \\#\\{ n\leq x: P(n)^2\mid n\\},$$
where $P(n)$ is the largest prime factor of $n$?

Status: open

### Choose either option
- [ ] I plan on working on this conjecture
- [x] This issue is up for grabs: I would like to see this conjecture added by somebody else