OR
Login With Google


Mathematics View Topics

Number Theory


  • Number Theory Introduction

  • A1--Subsets of Numbers

  • A2--Evens, Odds, Perfect Squares

  • A3--Pythagorean Triples

  • B1--Divisibility

  • B2--More Divisibility

  • B3--Even More Divisibility

  • B4--Fun Divisibility Problem

  • C1--Primes

  • C2--List of Primes From 1-100

  • C3--More Primes

  • C4--Factor Tree and Division Ladder

  • C5--When to Stop Checking for Prime Divisibility

  • C6--Prime Factors

  • C7--Reduce Fractions to Lowest Terms

  • C8--Formula for Generating "Some" Primes

  • D1--Greatest Common Divisor

  • D2-Greatest Common Divisor of Three Numbers

  • E1--Basis of The Euclidean Algorithm

  • E2--The Euclidean Algorithm

  • E3--More on The Euclidean Algorithm

  • E4--Even More on The Euclidean Algorithm

  • F1--Least Common Multiple

  • F2--Least Common Multiple With Variable

  • F3--Least Perfect Square Common Multiple

  • F4--Fun Product Problem

  • G1--Shortcuts for Finding GCD and LCM

  • G2--Relationship Between GCD and LCM

  • G3--Solving Problems Involving GCD and LCM

  • H1--Explore Total Number of Factors

  • H2--Apply Formula to Find Total Number of Factors

  • H3--More Challenging Problems With Total Number of Factors

  • H4--Fun Problem With Total Number of Divisors and Primes

  • H5--Exploring Divisor Products

  • H6--Apply Divisor Product Formula

  • I1--Units Digit

  • I2--More on Last Digit

  • I3--Even More With Units Digit

  • I4--Units Digit Problem With Two Numbers

  • I5--Units Digits and Perfect Squares

  • I6--Units Digits and Factorials

  • I7--Last Two Digits

  • J1--Basic Remainder Problem

  • J2--Basic Remainder Problem

  • J3--Basic Remainder Problem

  • J4--More Advanced Remainder Problem

  • J5--More Advanced Remainder Problem

  • J6--More Advanced Remainder Problem

  • K1--Exploring Trailing Zeros

  • K2--Trailing Zeros

  • K3--More on Trailing Zeros

  • K4--Trailing Zeros With Factorizations

  • K5--Shortcut for Trailing Zeros

  • K6--Shortcut for Trailing Zeros

  • K7--Advanced Problem With Trailing Zeros

  • L1--How to Count Consecutive Integers

  • L2--How to Count the Number of Multiples

  • L3--How to Count the Number of Multiples

  • M1--Exploring the Sum of the First n Natural Numbers

  • M2--Apply Sum of First n Natural Numbers Formula

  • M3--Advanced Problem with Sum of Natural Numbers

  • N1--Introduction to Linear Diophantine Equations

  • N2--Solve Basic Linear Diophantine Equation

  • N3--Simplify and Solve Linear Diophantine Equation

  • N4--Solve Linear Diophantine Equation with Right Hand Side Not Equal to 1

  • O1--Introduction to Modular Arithmetic

  • O2--Congruence in Modular Arithmetic

  • O3--Integers in Modular Arithmetic and "Modding Out"

  • O4--Congruence Properties

  • O5--Addition and Subtraction in Modular Arithmetic

  • O6--Multiplying and Exponents in Modular Arithmetic

  • O7--Multiplying and Exponents in Modular Arithmetic

  • O8--Division in Modular Arithmetic

  • O9--Division in Modular Arithmetic

  • O10--Solving Systems of Linear Congruences

  • O11--Modular Arithmetic Problems

  • O12--Modular Arithmetic Problems

  • P1--Gear Problem and LCM

  • P2--Number Sense

  • P3--Number Sense

  • P4--Number Sense

  • P5--Number Sense
    X
  • YouTube search player position.