lean_workbook_plus_77172

⚠️ Retired — specification defect

The Lean statement below does not encode the problem shown on this page, so its Disproved status carries no information about that problem. Do not import this node or use it as a dependency.

Prove that $x^{p^{k}}-x^{p^{k-1}}\equiv 0 \pmod{p^{k}}$ for any prime p and integer x.

Why this node was retired

The posted statement is

theorem lean_workbook_plus_77172 : ∀ p : ℕ, ∀ k : ℕ, ∀ x : ℤ, (x ^ p ^ k - x ^ p ^ (k - 1)) % p ^ k = 0   :=  by sorry

The source primality condition on p was dropped.

The recorded counterexample refutes the statement as encoded. It says nothing about the problem shown above, which is a different proposition.

Proposed corrected statement

For prime p, positive k and integer x, prove pᵏ divides x^(pᵏ)−x^(p^(k−1)); state k=0 separately if retained.

Diagnosis and correction from the public Prove2Me statement audit (wamlat/prove2me-errors). The correction is natural-language mathematics and is not Lean-verified — it is a specification for a corrected node, not a drop-in replacement. No corrected replacement node exists yet.