(Hard) A composite number n is called a Carmichael number bn−1 ≡ 1 (mod n) for every number b such ... Base case: When n = 2 the formula a + c ≡ b + d (mod m) was already given. ... The sequence goes 1, 3, 7, 15, 31,... guess that it is equal to 2n+1 − 1. ... Prove (now using induction on n) that fm|fmn for all n ≥ 1.
Answer:
That would be n[tex]\geq 1\\[/tex]
Step-by-step explanation:
