Count positive indices in the coprime residue classes
ProvedKnodelPrimeCordial.case_mod_6_offset_0_residue_count__p2m_8f071b5d_2675_41bd_8723_304b8e6b90ee_a1graph-labelingknodel-graphp2o-gran-per-chapterp2o-plan-paperp2o-v1prime-cordial
When n % 12 = 6, exactly (n + 2) / 4 indices in Fin (n / 2) are positive and congruent to 1, 2, or 4 modulo 6.
Preamble
import Mathlib
Formal statement
theorem KnodelPrimeCordial.case_mod_6_offset_0_residue_count__p2m_8f071b5d_2675_41bd_8723_304b8e6b90ee_a1 (n : ℕ) (hmod : n % 12 = 6) :
(Finset.univ.filter fun j : Fin (n / 2) =>
j.val ≠ 0 ∧ j.val % 6 ∈ ({1, 2, 4} : Finset ℕ)).card =
(n + 2) / 4 := by sorrySource
Haque, Khanam, Shahriar, Prime cordial labeling of Knödel graph, manuscript (2026) (held version, sha256 366502170d8d7c65ccc2fcc6f5373dac872d6efdc838ba9e671eb578e4c08c60), Lemma 2.3, p.3 (PDF p.3); proof pp.4–6