SmoothCountLT swap first second
ProvedErdosProblems.Erdos269.smoothCountLT_swap_first_seconderdos-269theorem
Swapping the first two prime channels leaves the strict three-prime smooth count unchanged.
Preamble
import Definitions.Def_ErdosProblems_Erdos269_ResidueEscape import Definitions.Def_ErdosProblems_Erdos269_ThreePrimeRunningLcm import Definitions.Def_ErdosProblems_Erdos269_RestrictedFloorSum import Mathlib.Algebra.BigOperators.Group.Finset.Basic import Mathlib.Algebra.BigOperators.Group.Finset.Sigma import Mathlib.Algebra.GCDMonoid.Finset import Mathlib.Algebra.Ring.Parity import Mathlib.Data.Finset.Card import Mathlib.Data.Finset.Prod import Mathlib.Data.Int.ModEq import Mathlib.Data.Nat.Log import Mathlib.Data.Nat.Prime.Basic import Mathlib.Data.Nat.Prime.Int import Mathlib.Tactic import Mathlib.Tactic.Linarith import Mathlib.Tactic.NormNum import Mathlib.Tactic.Ring /-! # Erdős #269: restricted floor sums and local windows Problem-owned landing surface for the exact true-shell floor sums and the local-window residue reduction. No declaration here asserts the open cofinal anti-concentration theorem. -/ open scoped BigOperators /-! ## Exact finite strict counts -/ open ErdosProblems.Erdos269
Formal statement
theorem ErdosProblems.Erdos269.smoothCountLT_swap_first_second (p q r x : ℕ) :
smoothCountLT p q r x = smoothCountLT q p r x := by sorry
Source
Lean source (Apache-2.0): https://github.com/wcook04/plectis-erdos-lean/blob/cc7e541cf2081c6fef5a5e377d52e365e33b01eb/ErdosProblems/Erdos269/RestrictedFloorSum.lean#L31-L64
Related paper by Will Cook (CC-BY-4.0): https://github.com/wcook04/plectis-erdos/blob/551bae6dc6e732cf85172d66323c8d2bc77ba962/paper/269/erdos-269-three-prime-running-lcm.tex#L1-L260
Paper prior-art bibliography: https://github.com/wcook04/plectis-erdos/blob/551bae6dc6e732cf85172d66323c8d2bc77ba962/paper/269/erdos-269-three-prime-running-lcm.tex#L681-L689