Compfiles/Usa2020P3.lean
15 declarations, 0 contain sorry, 0 declared as axioms
USA Mathematical Olympiad 2020 Problem 3
Let p be an odd prime. An integer x is called a quadratic non-residue if p does not divide x − t² for any integer t.
Denote by A the set of all integers a such that 1 ≤ a < p, and both a and 4 − a are quadratic non-residues. Calculate the remainder when the product of the elements of A is divided by p.
Imports (2)
Imported by 1 file
- determine
Usamo2020P3.solution_valline 31 sourceno axioms what this means
Statement uses:
NatProof uses:
OfNat.ofNat1 instances, coercions and auxiliary constants left out.
- abbrev
Usamo2020P3.setA'line 48 source - abbrev
Usamo2020P3.setB'line 51 source - abbrev
Usamo2020P3.setC'line 54 source - lemma
Usamo2020P3.isSquare_mul_iff_sameline 57 source - lemma
Usamo2020P3.setC_eq_unionline 65 source - lemma
Usamo2020P3.disjoint_ABline 75 source - lemma
Usamo2020P3.p_two_ne_zeroline 79 source - lemma
Usamo2020P3.p_two_ne_fourline 83 source - lemma
Usamo2020P3.two_mem_setCline 87 source - lemma
Usamo2020P3.map_mem_setBline 90 source - lemma
Usamo2020P3.fiber_prodline 99 source - lemma
Usamo2020P3.prod_C_erase_eq_prod_Bline 124 source - lemma
Usamo2020P3.prod_B_ne_zeroline 131 source - problem
Usamo2020P3.usa2020_p3line 138 sourcestandard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses:
Nat,Fact,Nat.Prime,Ne,OfNat.ofNat,Eq,ZMod,Finset.prod,Finset.filter,And,Not,IsSquare,HSub.hSub,Finset.univ, Usamo2020P3.solution_valProof uses:
mul_left_cancel₀,Trans.trans,HMul.hMul,Finset.erase,Eq.mpr,Union.union,Finset,id,congrArg,Finset.prod_union,mul_comm,Eq.refl,Eq.symm,Finset.mul_prod_erase,of_eq_true,Eq.trans,True,Mathlib.Meta.NormNum.instAtLeastTwo,Mathlib.Meta.NormNum.IsNat.to_eq,Mathlib.Meta.NormNum.isNat_natCastand 4 more98 instances, coercions and auxiliary constants left out.
Tactic trace: 5 steps
Open to load the checked before-and-after goal states.