ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Call a positive integer mm powerful if for every prime pp with p∣mp \mid m one also has p2∣mp^{2} \mid m; equivalently, mm is powerful if and only if m=a2b3m = a^{2}b^{3} for some positive integers a,ba, b. Writing the prime factorization as m=∏ipiαim=\prod_i p_i^{\alpha_i}, this says that αi≥2\alpha_i \geq 2 for every ii.

For every integer n≥1n \geq 1, the three consecutive integers nn, n+1n+1, n+2n+2 are not all powerful; that is, there is no n≥1n \geq 1 such that each of nn, n+1n+1, n+2n+2 satisfies the condition that every prime dividing it divides it at least twice.

Record

Added
Links

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.