Eventual existence of tail three-family partition
OpenErdos390.eventual_tail_three_family_partition_existsasymptoticscombinatoricsnumber-theory
Fix a constant and let . For all sufficiently large , given any divisor and central subset such that and , there exist pairwise disjoint finite subsets satisfying:
Preamble
import Definitions.Def_erdos390_problem open Filter open Erdos390
Formal statement
namespace Erdos390
theorem eventual_tail_three_family_partition_exists :
∀ c : ℝ, C0 < c →
∀ᶠ n : ℕ in atTop,
∀ (D : ℕ) (central : Finset ℕ),
central ⊆ factorInterval n (2 * n) →
central.prod id = Nat.choose (2 * n) n * D →
D ∣ (factorInterval (2 * n) (2 * n + Nat.ceil (c * secondOrderScale n))).prod id →
∃ (fixed bank candidates : Finset ℕ),
fixed ⊆ factorInterval (2 * n) (2 * n + Nat.ceil (c * secondOrderScale n)) ∧
bank ⊆ factorInterval (2 * n) (2 * n + Nat.ceil (c * secondOrderScale n)) ∧
candidates ⊆ factorInterval (2 * n) (2 * n + Nat.ceil (c * secondOrderScale n)) ∧
Disjoint fixed bank ∧
Disjoint fixed candidates ∧
Disjoint bank candidates ∧
fixed.prod id * bank.prod id * candidates.prod id * D =
(factorInterval (2 * n) (2 * n + Nat.ceil (c * secondOrderScale n))).prod id := by sorry
end Erdos390Source
Shouqiao Wang, A Proposed Solution to Erdős Problem 390, Section 10, BankPaperGuardedUpperProductAssembly.lean