@ceccec/millennium-solutions 9.2.5 → 9.2.7

package/src/proof/reversal.lean

@@ -70,4 +70,79 @@ theorem reversal_is_involutive_exactly_off_the_trailing_zeros :
 def settledHere : Nat := 8
 theorem reversal_settles_its_range : settledHere = 8 := rfl
 
+
+-- ── the capped rows above, proved for every value by induction — no bound ────────────────────────────────────
+-- casting out nines, in general: a number, its digit sum and its reversal share their residue mod 9.
+theorem foldl_add_start : ∀ (l : List Nat) (a : Nat), l.foldl (· + ·) a = a + l.foldl (· + ·) 0 := by
+  intro l
+  induction l with
+  | nil => intro a; simp
+  | cons x xs ih =>
+    intro a
+    simp only [List.foldl]
+    rw [ih (a + x), ih (0 + x)]
+    omega
+
+theorem the_digits_sum_to_the_number_mod_nine_when_the_fuel_covers_them :
+    ∀ f n : Nat, n < 10 ^ f → (digitsF f n).foldl (· + ·) 0 % 9 = n % 9 := by
+  intro f
+  induction f with
+  | zero =>
+    intro n h
+    have : n = 0 := by simp at h; omega
+    subst this
+    simp [digitsF]
+  | succ f ih =>
+    intro n h
+    cases n with
+    | zero => simp [digitsF]
+    | succ m =>
+      simp only [digitsF, List.foldl]
+      rw [foldl_add_start]
+      have hlt : (m + 1) / 10 < 10 ^ f := by
+        rw [Nat.pow_succ] at h
+        omega
+      have := ih ((m + 1) / 10) hlt
+      omega
+
+theorem a_number_is_below_ten_to_its_own_successor : ∀ n : Nat, n < 10 ^ (n + 1) := by
+  intro n
+  induction n with
+  | zero => decide
+  | succ n ih =>
+    rw [Nat.pow_succ]
+    omega
+
+theorem the_digit_sum_has_the_residue_of_the_number_mod_nine_for_every_n :
+    ∀ n : Nat, digitSum n % 9 = n % 9 := by
+  intro n
+  unfold digitSum digits
+  split
+  · rename_i h
+    have : n = 0 := by simpa using h
+    subst this
+    rfl
+  · exact the_digits_sum_to_the_number_mod_nine_when_the_fuel_covers_them (n + 1) n (a_number_is_below_ten_to_its_own_successor n)
+
+theorem folding_by_ten_keeps_the_residue_of_the_digit_sum :
+    ∀ (l : List Nat) (a : Nat), (l.foldl (fun a d => a * 10 + d) a) % 9 = (a + l.foldl (· + ·) 0) % 9 := by
+  intro l
+  induction l with
+  | nil => intro a; simp
+  | cons x xs ih =>
+    intro a
+    simp only [List.foldl]
+    rw [ih (a * 10 + x), foldl_add_start xs (0 + x)]
+    omega
+
+-- digital_root_is_invariant_under_reversal checked 1 ≤ n ≤ 300; this proves it for every n.
+theorem reversal_keeps_the_residue_mod_nine_for_every_n :
+    ∀ n : Nat, reverseNum n % 9 = n % 9 := by
+  intro n
+  have h1 : reverseNum n % 9 = digitSum n % 9 := by
+    unfold reverseNum digitSum
+    rw [folding_by_ten_keeps_the_residue_of_the_digit_sum]
+    simp
+  rw [h1, the_digit_sum_has_the_residue_of_the_number_mod_nine_for_every_n]
+
 end Reversal

package/src/proof/split.lean

@@ -188,4 +188,12 @@ theorem the_orbit_turns_once_per_budget :
   ((List.range 60).all (fun n => 2 ^ (n + 6) % 9 == 2 ^ n % 9)) ∧ 2 ^ 6 = sealBits / coins := by decide
 
 
+
+-- ── the capped row above, proved for every value — no bound ───────────────────────────────────────────────────
+-- the_coin_step_and_the_coins_are_inverse checked c < 20; this proves tripling and dividing by three undo each other for every c.
+theorem the_coin_step_and_the_coins_are_inverse_for_every_c :
+    ∀ c : Nat, 3 * c / 3 = c ∧ (3 * c) % 3 = 0 := by
+  intro c
+  exact ⟨Nat.mul_div_cancel_left c (by decide), Nat.mul_mod_right 3 c⟩
+
 end Split

package/src/proof/trial-all.json

@@ -15478,5 +15478,299 @@
     "verdict": "UNVERIFIED",
     "ground": "no candidate in the current space — nothing to recompute",
     "receipt": "6dec28f9-502b-86ee-8f87-d09f701ed7e7"
+  },
+  {
+    "key": "lean_demand_mantels_bound_is_n_squared_over_four_for_every_n",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "b9212e56-a3ea-8d6d-be87-f946b87d6b6c"
+  },
+  {
+    "key": "lean_demand3_the_euler_characteristic_of_a_genus_g_surface_for_every_g",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "a1a899d7-b3c5-8941-b02c-55f111d49fca"
+  },
+  {
+    "key": "lean_demand3_a_repunit_has_the_residue_of_its_length_mod_three",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "732113b8-a6d4-8b14-8681-6f31d2a78e30"
+  },
+  {
+    "key": "lean_demand3_a_repunit_is_divisible_by_three_exactly_when_its_length_is_for_every_n",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "93c43bd9-4707-8199-be02-c954c8916904"
+  },
+  {
+    "key": "lean_demand3_repunit_of_a_sum",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "5558e77e-438c-84e4-9a58-2520685771a3"
+  },
+  {
+    "key": "lean_demand3_repunits_repeat_mod_seven_every_six_digits",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "a67a8eec-997b-86f2-adbe-b77355dafc70"
+  },
+  {
+    "key": "lean_demand3_a_repunit_has_the_residue_of_its_length_mod_six_mod_seven",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "ec5bf7fe-1dd8-863d-8443-8682088d254b"
+  },
+  {
+    "key": "lean_demand3_a_repunit_is_divisible_by_seven_exactly_when_six_divides_its_length_for_every_n",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "2bb98278-186d-8284-9c6e-9c9e74177679"
+  },
+  {
+    "key": "lean_elementary_the_interior_and_exterior_angles_are_n_straight_angles_for_every_n",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "d1fbd7f1-d1df-8c7f-bb56-d565780d1db2"
+  },
+  {
+    "key": "lean_elementary_a_product_of_consecutive_numbers_is_even",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "cf763033-1ed3-82d8-866e-88ea2a38b2d1"
+  },
+  {
+    "key": "lean_elementary_eight_times_a_triangular_number_plus_one_is_an_odd_square_for_every_n",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "1aa59ef6-880c-8e39-b946-1b88e426040e"
+  },
+  {
+    "key": "lean_energy_two_parts_in_three_is_two_thirds_at_every_scale_for_every_m",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "9177c3d3-8280-8d65-9df5-c27b42454279"
+  },
+  {
+    "key": "lean_families_the_powers_of_two_sum_to_one_less_than_the_next_for_every_n",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "3cab57ca-4d36-8f80-a221-21c11d25adc9"
+  },
+  {
+    "key": "lean_families_square_of_successor",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "f9826dc5-b85d-8a85-800b-f6027e83a0cf"
+  },
+  {
+    "key": "lean_families_the_first_n_odd_numbers_sum_to_n_squared_for_every_n",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "7baff487-adea-8866-9d67-71fbbb0cdee6"
+  },
+  {
+    "key": "lean_mechanical_consecutive_squares_differ_by_the_odd_numbers",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "65131201-9df7-8805-8427-c1407fcd92cf"
+  },
+  {
+    "key": "lean_mechanical_every_multiple_of_three_four_five_is_pythagorean",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "a20992d7-56ea-8048-a939-96fc2fdc451d"
+  },
+  {
+    "key": "lean_mechanical_the_product_of_three_consecutive_numbers_is_even",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "0eb7327f-0789-8918-8365-8d4188436e01"
+  },
+  {
+    "key": "lean_mechanical_the_product_of_three_consecutive_numbers_is_a_multiple_of_three",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "f3e2ee80-28d1-89e3-92c7-082265ef98dc"
+  },
+  {
+    "key": "lean_mechanical_the_product_of_any_three_consecutive_integers_is_divisible_by_six_for_every_n",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "65518577-2bc3-82a2-97f8-f6cd4f7d1b62"
+  },
+  {
+    "key": "lean_reversal_foldl_add_start",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "70a7cff5-e668-8f44-a8d0-797abfa246c8"
+  },
+  {
+    "key": "lean_reversal_the_digits_sum_to_the_number_mod_nine_when_the_fuel_covers_them",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "58d4c502-7f73-8e6c-923e-76fdf25fc81c"
+  },
+  {
+    "key": "lean_reversal_a_number_is_below_ten_to_its_own_successor",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "dc7330c0-7a4c-8d99-9874-37c4c10fd1bb"
+  },
+  {
+    "key": "lean_reversal_the_digit_sum_has_the_residue_of_the_number_mod_nine_for_every_n",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "1a8922c4-c55c-88a0-b55a-23663d22fe49"
+  },
+  {
+    "key": "lean_reversal_folding_by_ten_keeps_the_residue_of_the_digit_sum",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "c7ce0223-8884-8e3a-84a1-dded449c3cb0"
+  },
+  {
+    "key": "lean_reversal_reversal_keeps_the_residue_mod_nine_for_every_n",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "3159b043-f18c-8c28-b831-114d6dc70ce2"
+  },
+  {
+    "key": "lean_split_the_coin_step_and_the_coins_are_inverse_for_every_c",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "1c1ebe41-4e80-80ad-b352-e90a09922838"
+  },
+  {
+    "key": "lean_light_the_second_returns_from_the_metre_and_the_period_for_every_s",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "1de974bb-854a-879c-a8f0-712b59f8d7bc"
+  },
+  {
+    "key": "lean_mechanical_repeated_doubling_is_the_power_of_two_for_every_k",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "71d6eeaa-fd06-8af1-893f-dfa60297892d"
+  },
+  {
+    "key": "lean_mechanical_relation_digitroot_is_residue_mod9_for_every_n",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "22aed33c-e7ff-80ef-aded-b466c40bf0e4"
+  },
+  {
+    "key": "lean_mechanical_the_nine_times_table_always_digital_roots_to_nine_for_every_k",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "36b3b4ea-25f1-8083-b075-d707f2fb91ea"
+  },
+  {
+    "key": "lean_mechanical_the_digital_root_has_the_residue_of_its_number",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "efc4383f-1f52-8cfc-9d4a-d291f4aa5bd4"
+  },
+  {
+    "key": "lean_mechanical_a_digital_root_lies_between_one_and_nine",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "298da32e-60d7-8bf9-9135-c6e904ae937f"
+  },
+  {
+    "key": "lean_mechanical_casting_out_nines_is_multiplicative_for_every_a_b",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "58842a8d-45b2-8316-b9a6-440b595e6782"
+  },
+  {
+    "key": "lean_mechanical_the_moduli_dimensions_are_three_g_minus_three_and_six_g_minus_six_for_every_g",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "633ba212-336a-8600-90d6-836751f6b813"
+  },
+  {
+    "key": "lean_reach_exhaustion_never_reaches_its_own_bound_for_every_n",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "dfc2849f-3870-823b-ade5-f036c5f40166"
+  },
+  {
+    "key": "lean_reach_the_successor_of_every_bound_lies_outside_for_every_n",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "1113761c-4967-898e-a9d9-d836a27b42ae"
+  },
+  {
+    "key": "lean_reach_doubling_the_domain_leaves_the_same_hole_for_every_n",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "f57338c8-104b-8058-90f6-b86622f64f86"
+  },
+  {
+    "key": "lean_z9plus_doubling_has_period_six_for_every_k",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "2c9ca8bc-08a6-87e8-ba10-0390547c7318"
+  },
+  {
+    "key": "lean_z9plus_orbit_digital_roots_have_period_six_for_every_k",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "e88dfdf8-3c33-87c9-b480-65d2db2769ac"
+  },
+  {
+    "key": "lean_z9plus_the_doubling_orbit_is_read_from_the_exponent_mod_six",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "c688c966-b59f-8e39-91d8-fa1f9fc564a0"
+  },
+  {
+    "key": "lean_z9plus_the_orbit_never_meets_the_triad_for_every_k",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "8c3dfc38-91e6-8a00-9d2f-ac18974cd169"
+  },
+  {
+    "key": "lean_z9plus_fibonacci_residues_mod_nine_repeat_every_twenty_four_steps",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "04f6a9cd-b19f-8b13-b5d9-7d88fec0139e"
+  },
+  {
+    "key": "lean_z9plus_pisano_period_mod_nine_is_twenty_four_for_every_k",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "985c1ebe-dc19-877e-8573-82765db72126"
+  },
+  {
+    "key": "lean_z9plus_the_fuelled_gcd_is_the_gcd_when_the_fuel_exceeds_the_second_argument",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "73c32b16-76ca-8bbc-91f3-3d550cd02477"
+  },
+  {
+    "key": "lean_z9plus_consecutive_fibonacci_numbers_are_coprime",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "5ae6ebcf-4c89-80d4-bc8c-1e5fed479a69"
+  },
+  {
+    "key": "lean_z9plus_consecutive_fibonacci_are_coprime_for_every_n",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "424d4751-1648-8d01-b6aa-e31be117166a"
+  },
+  {
+    "key": "lean_z9plus_digital_root_agrees_with_the_residue_for_every_n",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "20da0230-2b9f-8735-848e-8009809d9f04"
+  },
+  {
+    "key": "lean_z9plus_digital_root_is_the_digit_sum_residue_for_every_n",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "694fefdf-a71b-8019-84e5-04477e7be3d8"
   }
 ]

package/src/proof/z9plus.lean

@@ -205,4 +205,96 @@ theorem both_parts_sum_to_zero :
   m9 ((R.filter (fun d => R.any (fun e => m9 (d * e) == 1))).foldl (· + ·) 0) == 0
   ∧ m9 ((R.filter (fun d => ! R.any (fun e => m9 (d * e) == 1))).foldl (· + ·) 0) == 0 := by decide
 
+
+-- ── the capped rows above, proved for every value — no bound ─────────────────────────────────────────────────
+-- doubling_has_period_six (k < 30), orbit_digital_roots_have_period_six (k < 24), the_orbit_never_meets_the_triad
+-- (k < 40), pisano_period_mod_nine_is_twenty_four (k < 30), consecutive_fibonacci_are_coprime (n ≤ 25) and
+-- digital_root_agrees_with_the_residue (n ≤ 300) were checked up to a bound; these prove them for every value.
+-- 2⁶ ≡ 1 mod 9 turns the orbit; the pair (fib k, fib (k+1)) mod 9 returns after 24 steps; gcd9 is Euclid with fuel
+-- a + b + 1, which always exceeds what Euclid needs, so it is the gcd.
+theorem doubling_has_period_six_for_every_k : ∀ k : Nat, pw 2 (k + 6) = pw 2 k := by
+  intro k
+  unfold pw m9
+  rw [Nat.pow_add, Nat.mul_mod]
+  have h : 2 ^ 6 % 9 = 1 := by decide
+  rw [h, Nat.mul_one, Nat.mod_mod]
+
+theorem orbit_digital_roots_have_period_six_for_every_k : ∀ k : Nat, dr (pw 2 (k + 6)) = dr (pw 2 k) := by
+  intro k
+  rw [doubling_has_period_six_for_every_k]
+
+theorem the_doubling_orbit_is_read_from_the_exponent_mod_six : ∀ k : Nat, pw 2 k = pw 2 (k % 6) := by
+  intro k
+  induction k using Nat.strongRecOn with
+  | _ k ih =>
+    if hk : k < 6 then rw [Nat.mod_eq_of_lt hk]
+    else
+      have e : k = (k - 6) + 6 := by omega
+      rw [e, doubling_has_period_six_for_every_k, ih (k - 6) (by omega), Nat.add_mod_right]
+
+theorem the_orbit_never_meets_the_triad_for_every_k : ∀ k : Nat, pw 2 k ≠ 0 ∧ pw 2 k ≠ 3 ∧ pw 2 k ≠ 6 := by
+  intro k
+  rw [the_doubling_orbit_is_read_from_the_exponent_mod_six]
+  have h : k % 6 < 6 := Nat.mod_lt _ (by decide)
+  generalize k % 6 = j at h ⊢
+  revert j
+  decide
+
+theorem fibonacci_residues_mod_nine_repeat_every_twenty_four_steps :
+    ∀ k : Nat, fib (k + 24) % 9 = fib k % 9 ∧ fib (k + 25) % 9 = fib (k + 1) % 9 := by
+  intro k
+  induction k with
+  | zero => decide
+  | succ k ih =>
+    refine ⟨ih.2, ?_⟩
+    show (fib (k + 24) + fib (k + 25)) % 9 = (fib k + fib (k + 1)) % 9
+    rw [Nat.add_mod, ih.1, ih.2, ← Nat.add_mod]
+
+theorem pisano_period_mod_nine_is_twenty_four_for_every_k : ∀ k : Nat, fib9 (k + 24) = fib9 k := by
+  intro k
+  exact (fibonacci_residues_mod_nine_repeat_every_twenty_four_steps k).1
+
+theorem the_fuelled_gcd_is_the_gcd_when_the_fuel_exceeds_the_second_argument :
+    ∀ f a b : Nat, b < f → gcdF f a b = Nat.gcd a b := by
+  intro f
+  induction f with
+  | zero => intro a b h; exact absurd h (Nat.not_lt_zero b)
+  | succ f ih =>
+    intro a b h
+    cases b with
+    | zero => show a = Nat.gcd a 0; rw [Nat.gcd_zero_right]
+    | succ b =>
+      show gcdF f (b + 1) (a % (b + 1)) = Nat.gcd a (b + 1)
+      have hm : a % (b + 1) < b + 1 := Nat.mod_lt a (Nat.succ_pos b)
+      rw [ih (b + 1) (a % (b + 1)) (by omega), Nat.gcd_comm a (b + 1), Nat.gcd_rec (b + 1) a, Nat.gcd_comm]
+
+theorem consecutive_fibonacci_numbers_are_coprime : ∀ n : Nat, Nat.gcd (fib n) (fib (n + 1)) = 1 := by
+  intro n
+  induction n with
+  | zero => show Nat.gcd 0 1 = 1; exact Nat.gcd_zero_left 1
+  | succ n ih =>
+    show Nat.gcd (fib (n + 1)) (fib n + fib (n + 1)) = 1
+    rw [Nat.gcd_rec, Nat.add_mod_right, ← Nat.gcd_rec, Nat.gcd_comm, ih]
+
+theorem consecutive_fibonacci_are_coprime_for_every_n : ∀ n : Nat, gcd9 (fib n) (fib (n + 1)) = 1 := by
+  intro n
+  unfold gcd9
+  rw [the_fuelled_gcd_is_the_gcd_when_the_fuel_exceeds_the_second_argument _ _ _ (by omega)]
+  exact consecutive_fibonacci_numbers_are_coprime n
+
+theorem digital_root_agrees_with_the_residue_for_every_n : ∀ n : Nat, 0 < n → (dr n = 9 ↔ m9 n = 0) := by
+  intro n hn
+  unfold dr m9
+  rw [if_neg (show ¬ ((n == 0) = true) by simp; omega)]
+  by_cases h : n % 9 = 0
+  · simp [h]
+  · rw [if_neg (show ¬ ((n % 9 == 0) = true) by simpa using h)]
+    constructor
+    · intro e; have := Nat.mod_lt n (show 0 < 9 by decide); omega
+    · intro e; exact absurd e h
+
+theorem digital_root_is_the_digit_sum_residue_for_every_n : ∀ n : Nat, m9 (digitSum n) = m9 n := by
+  intro n
+  exact Reversal.the_digit_sum_has_the_residue_of_the_number_mod_nine_for_every_n n
+
 end Z9Plus