Compfiles/Imo1975P4.lean
10 declarations, 0 contain sorry, 0 declared as axioms
International Mathematical Olympiad 1975, Problem 4
When $4444^{4444}$ is written in decimal notation, the sum of its digits is $A$. Let $B$ be the sum of the digits of $A$. Find the sum of the digits of $B$. ($A$ and $B$ are written in decimal notation.)
Imports (2)
Imported by 1 file
- def
Imo1975P4.Aline 27 sourcestandard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses:
NatProof uses:
List.sum,Nat.digits,OfNat.ofNat,HPow.hPow8 instances, coercions and auxiliary constants left out.
- def
Imo1975P4.Bline 29 sourcestandard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses:
NatProof uses:
List.sum,Nat.digits,OfNat.ofNat, Imo1975P4.A4 instances, coercions and auxiliary constants left out.
- determine
Imo1975P4.sum_digits_Bline 31 sourceno axioms what this means
Statement uses:
NatProof uses:
OfNat.ofNat1 instances, coercions and auxiliary constants left out.
- theorem
Imo1975P4.Nat.mod_eq_iff_eqline 43 sourcestandard axioms: propext what this means
Statement uses:
Nat,LT.lt,Iff,Eq,HMod.hModProof uses:
Eq.mpr,id,congrArg,Iff.mpr,Nat.mod_eq_iff_lt,Nat.ne_zero_of_lt,Iff.rfl6 instances, coercions and auxiliary constants left out.
Tactic trace: 2 steps
Open to load the checked before-and-after goal states.
- theorem
Imo1975P4.Nat.modEq_iff_eq_ltline 48 sourcestandard axioms: propext what this means
Statement uses:
Nat,LT.lt,Iff,Nat.ModEq,EqProof uses:
Eq.mpr,HMod.hMod,id,congrArg,Nat.ModEq.eq_1,Iff.mpr,Nat.mod_eq_iff_lt,Nat.ne_zero_of_lt, Imo1975P4.Nat.mod_eq_iff_eq4 instances, coercions and auxiliary constants left out.
Tactic trace: 6 steps
Open to load the checked before-and-after goal states.
- theorem
Imo1975P4.Nat.digits_sum_le_mul_digits_lengthline 56 sourcestandard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses:
Nat,LT.lt,OfNat.ofNat,LE.le,List.sum,Nat.digits,HMul.hMul,List.length,HSub.hSubProof uses:
List.sum_le_length_nsmul,Membership.mem,List,Eq.mpr,id,Eq,congrArg,propext,Nat.le_sub_one_iff_lt,Nat.zero_lt_of_lt,Nat.digits_lt_base23 instances, coercions and auxiliary constants left out.
Tactic trace: 4 steps
Open to load the checked before-and-after goal states.
- theorem
Imo1975P4.Nat.digits_sum_le_logline 62 sourcestandard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses:
Nat,Ne,OfNat.ofNat,LT.lt,LE.le,List.sum,Nat.digits,HMul.hMul,HAdd.hAdd,Nat.log,HSub.hSubProof uses:
Eq.mpr,List.length,id,Eq,congrArg,Eq.symm,Nat.length_digits, Imo1975P4.Nat.digits_sum_le_mul_digits_length22 instances, coercions and auxiliary constants left out.
Tactic trace: 2 steps
Open to load the checked before-and-after goal states.
- theorem
Imo1975P4.Nat.digits_sum_le_of_leline 66 sourcestandard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses:
Nat,LT.lt,OfNat.ofNat,LE.le,List.sum,Nat.digits,HMul.hMul,HAdd.hAdd,Nat.clog,HSub.hSubProof uses:
dite,Eq,of_eq_true,Eq.trans,True,congrFun',congrArg,List,List.nil,Nat.digits_zero,Eq.symm,Not,Trans.simple,Nat.log, Imo1975P4.Nat.digits_sum_le_log,Eq.mpr,id,propext,mul_le_mul_iff_left₀,add_le_add_iff_rightand 4 more60 instances, coercions and auxiliary constants left out.
Tactic trace: 12 steps
Open to load the checked before-and-after goal states.
- theorem
Imo1975P4.Nat.clog_pow_le_clog_mulline 77 sourcestandard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses:
Nat,LT.lt,OfNat.ofNat,LE.le,Nat.clog,HPow.hPow,HMul.hMulProof uses:
dite,Eq,of_eq_true,Eq.trans,True,congr,congrArg,pow_zero,Nat.clog_one_right,MulZeroClass.mul_zero,Eq.symm,Not,Eq.mpr,id,propext,Nat.clog_le_iff_le_pow,pow_mul,Nat.pow_le_pow_iff_left,Nat.le_pow_clog32 instances, coercions and auxiliary constants left out.
Tactic trace: 6 steps
Open to load the checked before-and-after goal states.
- problem
Imo1975P4.imo1975_p4line 87 sourcestandard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses:
Eq,Nat, Imo1975P4.sum_digits_B,List.sum,Nat.digits,OfNat.ofNat, Imo1975P4.BProof uses:
Nat.ModEq,HPow.hPow,Eq.mpr,HMod.hMod,id,congrArg,Nat.ModEq.eq_1,Nat.pow_mod,of_eq_true,eq_self,HAdd.hAdd,HMul.hMul,congrFun',Eq.trans,pow_add,congr,pow_mul,pow_one,Nat.mul_mod,one_powand 23 more84 instances, coercions and auxiliary constants left out.
Tactic trace: 32 steps
Open to load the checked before-and-after goal states.