Skip to content

Erdős problem 937

Are there infinitely many four-term arithmetic progressions of coprime powerful numbers? (A number nn is *powerful* if p∣n→p2∣np \mid n \to p^2 \mid n; Nat.Powerful.)

Workspace

Continue locallyOpen sourceSign in to contribute

Open this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.

Canvas

public preview
  1. Source#937
  2. ResultNone
  3. Checks0

Search problems.science

Find a Problem, Result, source, or page