Proof of Lemma 1, p. 9 — for q₁ coprime with M, JRP^red(q₁) = (M − 1)²/q₁ + 4q₁ ≥ 4(M − 1)
ProvedJRPHard.Aperiodic.coprime_lower_boundam-gminteger-factorizationjoint-replenishmentp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be an odd composite number and let be a positive integer coprime with . Then , the reduced objective of problem (2) is
and consequently
Both the identity and the inequality are asserted.
So no period sharing no factor with can do better than ; an optimal must share a non-trivial factor with as soon as some other period beats .
Preamble
import Mathlib import Definitions.Def_JRPHard_Aperiodic_Setting
Formal statement
namespace JRPHard.Aperiodic
theorem coprime_lower_bound (M : ℕ) (hodd : Odd M) (h1 : 1 < M) (hcomp : ¬ M.Prime)
(q : ℕ) (hq : 0 < q) (hcop : Nat.Coprime q M) :
jrpRed M q = ((M : ℝ) - 1) ^ 2 / (q : ℝ) + 4 * (q : ℝ) ∧
4 * ((M : ℝ) - 1) ≤ jrpRed M q := by sorry
end JRPHard.Aperiodic
Source
Schulz and Telha, Integer factorization and Riemann's hypothesis: Why two-item joint replenishment is hard, arXiv:2007.09045v1, p. 9, proof of Lemma 1, "First, let us show that gcd(q₁*, M) > 1"
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.