is mentioned by
![]() ![]() ![]() ![]() ![]() ![]() | [prime_factorization_exists2] |
![]() Thm* ![]() ![]() ![]() ![]() ![]() Thm* n = ![]() ![]() ![]() | [prime_factorization_exists] |
![]() ![]() ![]() ![]() ![]() ![]() Thm* 2 ![]() Thm* ![]() ![]() Thm* ( ![]() ![]() ![]() ![]() ![]() ![]() ![]() Thm* ![]() ![]() Thm* ( ![]() ![]() ![]() ![]() ![]() Thm* ( ![]() ![]() ![]() ![]() ![]() ![]() | [prime_factorization_existsLEMMA] |
![]() ![]() ![]() ![]() ![]() ![]() Thm* ![]() Thm* ![]() ![]() Thm* ( ![]() ![]() ![]() ![]() ![]() Thm* ( ![]() ![]() ![]() ![]() ![]() ![]() Thm* (& g'(z) = 0 Thm* (& ( ![]() ![]() ![]() ![]() | [can_reduce_composite_factor2] |
![]() ![]() ![]() ![]() ![]() ![]() Thm* x ![]() Thm* ![]() ![]() Thm* ( ![]() ![]() ![]() ![]() ![]() Thm* ( ![]() ![]() ![]() ![]() ![]() ![]() Thm* (& h(x ![]() Thm* (& ( ![]() ![]() ![]() ![]() ![]() | [can_reduce_composite_factor] |
![]() ![]() Thm* prime(p) Thm* ![]() ![]() Thm* ( ![]() ![]() ![]() ![]() ![]() ![]() Thm* (a<b ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | [prime_divs_mul_via_intseg] |
![]() ![]() ![]() ![]() ![]() ![]() Thm* ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | [eval_factorization_not_one] |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | [eval_factorization_one_b] |
In prior sections: core quot 1 LogicSupplement int 2 num thy 1 SimpleMulFacts IteratedBinops
Try larger context:
DiscrMathExt
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html