Number Theory

  1. Prime Numbers and Factorization
    1. Prime and Composite Numbers
      1. Definition of Prime Numbers
        1. Definition of Composite Numbers
          1. The Number 1
            1. First Few Primes
            2. Prime Recognition and Generation
              1. Trial Division Method
                1. Sieve of Eratosthenes
                  1. Algorithm Description
                    1. Implementation Details
                      1. Efficiency Analysis
                        1. Variations and Improvements
                      2. Fundamental Theorem of Arithmetic
                        1. Statement of the Theorem
                          1. Existence of Prime Factorization
                            1. Uniqueness of Prime Factorization
                              1. Complete Proof
                                1. Applications and Consequences
                                2. Prime Factorization Techniques
                                  1. Trial Division
                                    1. Fermat's Factorization Method
                                      1. Basic Factorization Strategies
                                      2. Distribution and Properties of Primes
                                        1. Infinitude of Primes
                                          1. Euclid's Classical Proof
                                            1. Euler's Proof
                                              1. Other Proofs
                                              2. Prime Gaps
                                                1. Prime Density
                                                  1. Elementary Bounds on Primes

                                                Previous

                                                2. Divisibility Theory

                                                Go to top

                                                Next

                                                4. Greatest Common Divisor and Least Common Multiple