Try doing some basic maths questions in the Lean Theorem Prover. Functions, real numbers, equivalence relations and groups. Click on README.md and then on "Open in CoCalc with one click".
License: APACHE
oleanfile 3.4.2, commit cbd2b6686ddb ����% init data finset algebra big_operators tactic ring � �export_decl option none none some some export_decl bool ff ff tt tt export_decl has_andthen andthen andthen export_decl has_pow pow pow export_decl has_append append append export_decl decidable is_true is_true is_false is_false to_bool to_bool export_decl has_pure pure pure export_decl has_bind bind bind export_decl has_monad_lift_t monad_lift !monad_lift export_decl monad_functor_t monad_map $monad_map export_decl monad_run run 'run export_decl list mmap *mmap mmap' *mmap' mfilter *mfilter mfoldl *mfoldl export_decl native nat_map 3rb_map mk export_decl name_map native rb_map mk export_decl expr_map native rb_map mk export_decl tactic interaction_monad failed fail export_decl tactic_result interaction_monad result export_decl tactic Ftransparency reducible Greducible semireducible Gsemireducible export_decl tactic mk_simp_attr Lmk_simp_attr export_decl monad_except throw Othrow catch Ocatch export_decl monad_except_adapter adapt_except Tadapt_except export_decl monad_state_adapter adapt_state Wadapt_state export_decl monad_reader read Zread export_decl monad_reader_adapter adapt_reader ]adapt_reader export_decl is_lawful_functor map_const_eq `map_const_eq id_map `id_map comp_map `comp_map export_decl is_lawful_applicative seq_left_eq gseq_left_eq seq_right_eq gseq_right_eq pure_seq_eq_map gpure_seq_eq_map map_pure gmap_pure seq_pure gseq_pure seq_assoc gseq_assoc export_decl is_lawful_monad bind_pure_comp_eq_map tbind_pure_comp_eq_map bind_map_eq_seq tbind_map_eq_seq pure_bind tpure_bind bind_assoc tbind_assoc export_decl traversable traverse }traverse nspace maths_challenges decl �odd n nat � has_add add nat has_add has_mul mul nat has_mul bit0 has_one one nat has_one � PInfo �VMR �VMC � � nat mul nat add decl �equations _eqn_1 � eq � � eq refl � PInfo �ATTR _refl_lemma � � � EqnL �SEqnL �decl �challenge05 n finset sum nat add_comm_monoid finset range has_pow pow �has_pow � �rec � 4 ' (nat zero d hd 4eq mpr ' ( �succ 1 B add_semigroup to_has_add add_monoid to_add_semigroup add_comm_monoid to_add_monoid & A ' ( A Hid I \eq rec E_a ` ' ( @ 1 h n _ I Zfinset sum_range_succ & A ? \ V 1 A H ^ ` \ � e Y_a ` T g ' ( g n � n v \ � ^ �eq trans A �tactic ring horner �comm_semiring � A A 1 A norm_num subst_into_sum � � � A � has_zero zero nat has_zero � � � � � �norm_num subst_into_prod A � � � tactic ring horner_atom � Atactic ring horner_const_mul � A � � � � mul_one �monoid � � � � � �mul_zero semiring to_mul_zero_class �semiring �tactic ring horner_add_const � A � � � � � �norm_num bin_zero_add �add_monoid � � /monoid has_pow � A �eq symm � 0 �nat pow_eq_pow A tactic ring subst_into_pow � A � � � �tactic ring horner_pow � A � � �norm_num mul_bit0_helper �distrib � � � . semigroup to_has_mul monoid to_semigroup � norm_num pow_bit0_helper � pow_one � � O � � � ]tactic ring horner_add_horner_lt � A � � � � �norm_num one_add_one tactic ring const_add_horner � A � � � � � � norm_num bin_add_zero � # � � � � � � � � � 4 � � � � � . � � � 4 � � � � 7 � � > � � � � A � � � � � � A � � & � � � . � � � j � � � � �pow_succ' � � � �monoid pow � � � � � � � � � � � w � � � �tactic ring horner_mul_horner � A � � � � � A � � � � ecomm_semigroup to_semigroup �comm_semigroup � � � � � � �mul_comm � � � one_mul � � � � � � � �tactic ring horner_add_horner_eq � � � A � � � � � � � � & � � PInfo � EndFile