Compfiles/Usa1985P1.lean
5 declarations, 0 contain sorry, 0 declared as axioms
USA Mathematical Olympiad 1985, Problem 1
Determine whether or not there are any positive integral solutions of the simultaneous equations
x₁² + x₂² + ⋯ + x₁₉₈₅² = y³ x₁³ + x₂³ + ⋯ + x₁₉₈₅³ = z²
with distinct integers x₁, x₂, ⋯, x₁₉₈₅.
Imports (2)
Imported by 1 file
- lemma
Usa1985P1.nicomachusline 33 sourcestandard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses:
Nat,Eq,Finset.sum,Finset.range,HPow.hPow,OfNat.ofNatProof uses:
Nat.recAux,of_eq_true,Eq.trans,True,congrArg,zero_pow,Not,False,not_false_eq_true,eq_self,Eq.mpr,HAdd.hAdd,id,Finset.sum_range_succ,HMul.hMul,Mathlib.Tactic.Ring.of_eq,Nat.rawCast,Mathlib.Tactic.Ring.Common.pow_congr,Mathlib.Tactic.Ring.Common.add_congr,Mathlib.Tactic.Ring.Common.atom_pfand 47 more53 instances, coercions and auxiliary constants left out.
Tactic trace: 15 steps
Open to load the checked before-and-after goal states.
- lemma
Usa1985P1.nicomachus'line 54 sourcestandard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses:
Nat,Eq,Int,Finset.sum,Finset.range,HPow.hPow,HAdd.hAdd,OfNat.ofNatProof uses:
Eq.mpr,id,Eq.trans,congr,congrArg,Finset.sum_congr,Eq.refl,Finset,Membership.mem,congrFun',Eq.symm,Nat.cast_one, Usa1985P1.nicomachus,Eq.mp,Finset.sum_range_succ',add_zero47 instances, coercions and auxiliary constants left out.
Tactic trace: 4 steps
Open to load the checked before-and-after goal states.
- determine
Usa1985P1.does_existline 64 sourceno axioms what this means
Statement uses:
BoolProof uses:
Bool.true - abbrev
Usa1985P1.is_validline 66 sourcestandard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses:
Nat,IntProof uses:
And,Membership.mem,Finset,Finset.range,OfNat.ofNat,LT.lt,Eq,Finset.sum,HPow.hPow,Ne10 instances, coercions and auxiliary constants left out.
- problem
Usa1985P1.usa1985_p1line 73 sourcestandard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses:
ite,Eq,Bool, Usa1985P1.does_exist,Bool.true,Exists,Nat,Int, Usa1985P1.is_valid,NotProof uses:
Eq.mpr,id,Eq.trans,True,ite_congr,eq_self,Eq.refl,ite_true,Finset.sum,Finset.range,OfNat.ofNat,HAdd.hAdd,HPow.hPow,HMul.hMul,Membership.mem,Finset,LT.lt,Int.pos_of_sign_eq_one,rfl,Int.signand 85 more96 instances, coercions and auxiliary constants left out.
Tactic trace: 72 steps
Open to load the checked before-and-after goal states.