4 groups of 5 — Divisible ✓ 5 5 5 5
20 tiles in 4 groups of 5: divisible
Divisibility: Factors, Primes, GCD & LCM › What is Divisibility?
4 groups of 5 + 3 leftover 5 5 5 5 +3
23 = 5 · 4 + 3: four full rows and three left over
Divisibility: Factors, Primes, GCD & LCM › Divisibility and Remainders
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 The sieve finished: only the primes remain unmarked
Divisibility: Factors, Primes, GCD & LCM › Prime Numbers
Prime factorization — 360
Prime factorization — 360
360
2
180
2
90
2
45
3
15
3
5
360 = 2 3 · 3 2 · 5
360 = 2³ · 3² · 5 exponents 3, 2, 1 factors of 360: (3+1)(2+1)(1+1) = 24
Factoring 360 down to primes
Divisibility: Factors, Primes, GCD & LCM › Prime Factorization
252 = 105 · 2 + 42 105 = 42 · 2 + 21 42 = 21 · 2 + 0 stop gcd = 21 gcd(252, 105) = 21 by repeated division
Divisibility: Factors, Primes, GCD & LCM › GCD and LCM
Number line scene (single track) 0 3 6 9 12 15 18 21 24 27 30 33 36 39 42 45 48 51 54 57 60 63 … 3 | 12, 3 | 36, 3 | 60 If 3 divides 12, it also divides every multiple of 12. Number line scene (single track)
Divisibility: Factors, Primes, GCD & LCM › Basic Properties
Factor pairs factors of 24 — found by testing 1 to √24 ≈ 4.90 1 · 24 = 24 2 · 12 = 24 3 · 8 = 24 4 · 6 = 24 1 2 3 4 6 8 12 24 factors of 24 (in pairs) (1, 24), (2, 12), (3, 8), (4, 6) search stops at √24 Factor pairs
Divisibility: Factors, Primes, GCD & LCM › Factors and Multiples
÷1 ÷2 ÷3 ÷4 ÷5 ÷6 ÷7 ÷8 ÷9 ÷10 ÷11 ÷12 ✕ 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100
The ÷3 column: the multiples of 3 marked down the table
Factors and Multiples: Divisors, Pairs & Counting › Multiples
Factor set (single) factors of 24 1 2 3 4 6 8 12 24 factors of 24 {1, 2, 3, 4, 6, 8, 12, 24} 8 factors total
Factor set (single)
Factors and Multiples: Divisors, Pairs & Counting › Factors (Divisors)
Factor pairs factors of 36 — found by testing 1 to √36 = 6 1 · 36 = 36 2 · 18 = 36 3 · 12 = 36 4 · 9 = 36 6 · 6 1 2 3 4 6 9 12 18 36 √36 = 6 stop testing here pairs by testing 1 → √36 (1, 36), (2, 18), (3, 12), (4, 9), (6, 6) 6 tests → 9 factors Factor pairs
Factors and Multiples: Divisors, Pairs & Counting › Finding All Factors
Factor pairs factors of 24 — found by testing 1 to √24 ≈ 4.90 1 · 24 = 24 2 · 12 = 24 3 · 8 = 24 4 · 6 = 24 1 2 3 4 6 8 12 24 factor pairs of 24 (1, 24), (2, 12), (3, 8), (4, 6) each pair multiplies to 24 Factor pairs
Factors and Multiples: Divisors, Pairs & Counting › Factor Pairs
Factor set (single) factors of 12 1 2 3 4 6 12 sum = 16 > 12 (abundant) proper divisors of 12 {1, 2, 3, 4, 6} 1+2+3+4+6 = 16 16 > 12 → abundant
Factor set (single)
Factors and Multiples: Divisors, Pairs & Counting › Proper Divisors
Split view (factors vs multiples) factors of 24 1 2 3 4 6 8 12 24 multiples of 24 24 48 72 96 120 … factors vs multiples factors of 24: 1, 2, 3, 4, 6, 8, 12, 24 8 values, finite multiples of 24: 24, 48, 72, 96, … infinitely many 24 is the pivot — largest factor, smallest multiple. Split view (factors vs multiples)
Factors and Multiples: Divisors, Pairs & Counting › Factors vs Multiples
Common factors of two numbers factors of 12 1 2 3 4 6 12 factors of 18 1 2 3 6 9 18 gcd(12, 18) = 6 largest common factor common factors {1, 2, 3, 6} gcd(12, 18) = 6
Common factors of two numbers
Factors and Multiples: Divisors, Pairs & Counting › Common Factors
Factor set (single) factors of 72 1 2 3 4 6 8 9 12 18 24 36 72 12 factors 72 = 2³ · 3² (3+1)(2+1) = 12 matches the chip count
Factor set (single)
Factors and Multiples: Divisors, Pairs & Counting › Counting Factors
Factor set (single) factors of 12 1 2 3 4 6 12 σ(12) = 28 σ(12) — sum of all divisors 1+2+3+4+6+12 = 28 28 > 2·12 → abundant
Factor set (single)
Factors and Multiples: Divisors, Pairs & Counting › Sum of Factors
252 = 105 · 2 + 42 105 = 42 · 2 + 21 42 = 21 · 2 + 0 stop gcd = 21 gcd(252, 105) = 21 in three divisions
GCD: Greatest Common Divisor & Euclidean Algorithm › Method 3: Euclidean Algorithm
Common factors of two numbers factors of 8 1 2 4 8 factors of 15 1 3 5 15 gcd(8, 15) = 1 largest common factor factors of 8 and 15 only 1 is shared gcd(8, 15) = 1 coprime, yet neither number is prime
Coprime without being prime
GCD: Greatest Common Divisor & Euclidean Algorithm › Coprime (Relatively Prime) Numbers
Common factors of two numbers factors of 12 1 2 3 4 6 12 factors of 18 1 2 3 6 9 18 gcd(12, 18) = 6 largest common factor common factors of 12 and 18 {1, 2, 3, 6} gcd(12, 18) = 6
Common factors of two numbers
GCD: Greatest Common Divisor & Euclidean Algorithm › What is GCD?
Common factors of two numbers factors of 24 1 2 3 4 6 8 12 24 factors of 36 1 2 3 4 6 9 12 18 36 gcd(24, 36) = 12 largest common factor common factors of 24 and 36 {1, 2, 3, 4, 6, 12} gcd(24, 36) = 12
Common factors of two numbers
GCD: Greatest Common Divisor & Euclidean Algorithm › Method 1: Listing Factors
Prime factorizations — gcd(48, 180)
Prime factorizations — gcd(48, 180)
48
2⁴ · 3
2
2
2
2
2
3
3
5
180
2² · 3² · 5
2
2
2
3
3
3
5
5
GCD takes the minimum exponent of each shared prime:
gcd(48, 180) = 2 2 · 3 = 12
gcd(48, 180) = 12 48 = 2⁴ · 3 180 = 2² · 3² · 5 Amber: shared portion at the smaller exponent per prime. Dashed: excess + unshared. 2² · 3 = 4 · 3 = 12
Prime factorizations — gcd(48, 180)
GCD: Greatest Common Divisor & Euclidean Algorithm › Method 2: Prime Factorization
Euclidean algorithm chain Euclidean algorithm — gcd(462, 198) 462 = 198 · 2 + 66 198 = 66 · 3 + 0 stop gcd = 66 gcd(462, 198) = 66 Each step replaces the larger number by the remainder. Terminates in two steps — 66 divides 198 exactly. Euclidean algorithm chain
GCD: Greatest Common Divisor & Euclidean Algorithm › Euclidean Algorithm Step by Step
Euclidean algorithm chain Euclidean algorithm — gcd(1071, 462) 1071 = 462 · 2 + 147 462 = 147 · 3 + 21 147 = 21 · 7 + 0 stop gcd = 21 gcd(1071, 462) = 21 Three steps, larger inputs. Same termination condition: remainder reaches 0. Euclidean algorithm chain
GCD: Greatest Common Divisor & Euclidean Algorithm › Euclidean Algorithm Step by Step
48 × 80 rectangle Aspect ratio 48:80 reduced by gcd(48,80)=16 to 3:5. 3 5 48 80 aspect ratio 48 : 80 divide both by gcd(48, 80) = 16 48 / 16 = 3 80 / 16 = 5 48 : 80 = 3 : 5 3 and 5 are coprime — lowest terms
48 × 80 rectangle
GCD: Greatest Common Divisor & Euclidean Algorithm › Applications of GCD
48 × 80 rectangle Largest square tile of side gcd(48,80)=16; 3 × 5 = 15 tiles cover the rectangle exactly. 16 48 80 largest square tile side = gcd(48, 80) = 16 48 / 16 = 3 tiles across 80 / 16 = 5 tiles down 3 × 5 = 15 tiles no gaps, no overlaps
48 × 80 rectangle
GCD: Greatest Common Divisor & Euclidean Algorithm › Applications of GCD
÷1 ÷2 ÷3 ÷4 ÷5 ÷6 ÷7 ÷8 ÷9 ÷10 ÷11 ÷12 ✕ 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100
The ÷6 column: 6, 12, 18, 24, …
LCM: Least Common Multiple & GCD Formula › Method 1: Listing Multiples
Number line scene (two tracks) 0 7 14 21 28 35 42 49 56 63 ×7 0 9 18 27 36 45 54 63 ×9 lcm = 63 lcm(7, 9) = 63 multiples of 7: 7, 14, 21, … 56, 63 multiples of 9: 9, 18, 27, … 54, 63 no meeting before 7 · 9 Coprime numbers meet only at their product
LCM: Least Common Multiple & GCD Formula › When aaa and bbb Are Coprime
Number line scene (two tracks) 0 4 8 12 16 20 24 ×4 0 6 12 18 24 ×6 lcm = 12 lcm(4, 6) = 12 multiples of 4: 4, 8, 12, 16, 20, 24, … multiples of 6: 6, 12, 18, 24, … common multiples: 12, 24, 36, … smallest = 12 Number line scene (two tracks)
LCM: Least Common Multiple & GCD Formula › What is LCM?
Prime factorizations — lcm(12, 18)
Prime factorizations — lcm(12, 18)
12
2² · 3
2
2
2
3
3
18
2 · 3²
2
2
3
3
3
LCM takes the maximum exponent of each prime:
lcm(12, 18) = 2 2 · 3 2 = 36
lcm(12, 18) = 36 12 = 2² · 3 18 = 2 · 3² Amber: full coverage at the larger exponent per prime. Every prime appears at its max — nothing is missing. 2² · 3² = 4 · 9 = 36
Prime factorizations — lcm(12, 18)
LCM: Least Common Multiple & GCD Formula › Method 2: Prime Factorization
Number line scene (two tracks) 0 12 24 36 Bus A 0 18 36 Bus B lcm = 36 lcm(12, 18) = 36 Bus A every 12 min, Bus B every 18 min. Both arrive together every 36 minutes. Number line scene (two tracks)
LCM: Least Common Multiple & GCD Formula › Applications of LCM
÷1 ÷2 ÷3 ÷4 ÷5 ÷6 ÷7 ÷8 ÷9 ÷10 ÷11 ÷12 ✕ 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100
The ÷2 column: every other number
Divisibility Rules: Tests for 2, 3, 4, 5, 6, 8, 9, 10, 11 › Divisibility by 2
126 Even or Odd? EVEN EVEN ÷2 ✓ ✓ ÷4? 26 ✗ ✓ ÷8? ✗ ÷8 ✗ ✗ ODD ÷2,4,6,8,10,12 ✗ ↓ merge ÷3? sum=9 ✓ ÷3 ✓ ÷9? ✓ ÷3 ✗ ÷9 ✗ ÷5? ends 6 ✗ ÷7? ✓ ÷11? alt=5 ✗ DERIVED ÷6 (2∧3) ÷10 (2∧5) ÷12 (3∧4)
126: digit sum 9, so divisible by 3 and by 9
Divisibility Rules: Tests for 2, 3, 4, 5, 6, 8, 9, 10, 11 › Divisibility by 3
÷1 ÷2 ÷3 ÷4 ÷5 ÷6 ÷7 ÷8 ÷9 ÷10 ÷11 ÷12 ✕ 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100
The ÷4 column: every fourth number
Divisibility Rules: Tests for 2, 3, 4, 5, 6, 8, 9, 10, 11 › Divisibility by 4
Divisibility by 5: last 1 digits of 4835 The last 1 digits of 4835 form 5, which is divisible by 5. 4 8 3 5 5 divisible by 5? check the last digit ends in 5 5 | 4835 Divisibility by 5: last 1 digits of 4835
Divisibility Rules: Tests for 2, 3, 4, 5, 6, 8, 9, 10, 11 › Divisibility by 5
Divisibility by 8: last 3 digits of 53104 The last 3 digits of 53104 form 104, which is divisible by 8. 5 3 1 0 4 104 divisible by 8? check the last 3 digits 104 ÷ 8 = 13 8 | 53104 Divisibility by 8: last 3 digits of 53104
Divisibility Rules: Tests for 2, 3, 4, 5, 6, 8, 9, 10, 11 › Divisibility by 8
Divisibility by 9: digit sum of 8127 The digits of 8127 sum to 18, which is divisible by 9. 8 1 2 7 + + + 18 divisible by 9? sum the digits 8 + 1 + 2 + 7 = 18 18 ÷ 9 = 2 9 | 8127 Divisibility by 9: digit sum of 8127
Divisibility Rules: Tests for 2, 3, 4, 5, 6, 8, 9, 10, 11 › Divisibility by 9
Divisibility by 10: last 1 digits of 5230 The last 1 digits of 5230 form 0, which is divisible by 10. 5 2 3 0 0 divisible by 10? check the last digit ends in 0 10 | 5230 Divisibility by 10: last 1 digits of 5230
Divisibility Rules: Tests for 2, 3, 4, 5, 6, 8, 9, 10, 11 › Divisibility by 10
Divisibility by 11: alternating sum of 9273 The alternating sum of 9273 from the right is -11, which is divisible by 11. 9 − 2 + 7 − 3 + ← start from the right −11 divisible by 11? alternating sum, right → left 3 − 7 + 2 − 9 = −11 11 | (−11) 11 | 9273
Divisibility by 11: alternating sum of 9273
Divisibility Rules: Tests for 2, 3, 4, 5, 6, 8, 9, 10, 11 › Divisibility by 11
A bar cut into 5 equal parts with 3 shaded: three fifths 3/5 1/5 1/5 1/5 1/5 1/5 denominator 5: the whole is cut into 5 equal parts numerator 3: three of those parts are taken The denominator names the part, the numerator counts them
Three fifths as parts of a bar
Fractions: Definition, Types & Operations › Numerator and Denominator
3/4 fits inside one whole; 5/3 fills one whole and two thirds of a second 3/4 1/4 1/4 1/4 1/4 5/3 1/3 1/3 1/3 1/3 1/3 1/3 proper: 3 of 4 parts, less than one whole improper: 5 thirds, one whole and 2 thirds more Proper stays inside one whole; improper spills over
Proper and improper on the same whole
Fractions: Definition, Types & Operations › Proper and Improper Fractions
Unit fractions 1/2, 1/4 and 1/8 on bars of the same whole: each is half the one before 1/2 1/2 1/2 1/4 1/4 1/4 1/4 1/4 1/8 1/8 1/8 1/8 1/8 1/8 1/8 1/8 1/8 same whole, more parts: each part is smaller 1/8 < 1/4 < 1/2 Larger denominator, smaller unit fraction
Unit fractions shrink as the denominator grows
Fractions: Definition, Types & Operations › Unit Fractions
2/7 plus 3/7 makes 5/7: five sevenths 2/7 1/7 1/7 1/7 1/7 1/7 1/7 1/7 + 3/7 1/7 1/7 1/7 1/7 1/7 1/7 1/7 = 5/7 1/7 1/7 1/7 1/7 1/7 1/7 1/7 all parts are sevenths: 2 parts + 3 parts = 5 parts the denominator stays 7; only the count changes Same denominator: add the numerators
Adding sevenths
Adding & Subtracting Fractions: Common Denominators › Same Denominator — The Simple Case
2/3 plus 1/4: rewritten as 8/12 plus 3/12, the sum is 11/12 2/3 1/3 1/3 1/3 = 8/12 1/4 1/4 1/4 1/4 1/4 = 3/12 = 11/12 twelfths fit both thirds and quarters (LCD 12) 8 twelfths + 3 twelfths = 11 twelfths Unlike denominators: convert, then add
Adding 2/3 and 1/4 through twelfths
Adding & Subtracting Fractions: Common Denominators › Converting to Common Denominator
Adding denominators: 1/2 plus 1/3 is not 2/5 but 5/6 1/2 1/2 1/2 + 1/3 1/3 1/3 1/3 ≠ 2/5 1/5 1/5 1/5 1/5 1/5 = 5/6 1/6 1/6 1/6 1/6 1/6 1/6 2/5 is shorter than 1/2 alone: a sum cannot shrink correct: 3/6 + 2/6 = 5/6 Never add the denominators
Why 1/2 + 1/3 is not 2/5
Adding & Subtracting Fractions: Common Denominators › Common Mistakes
3/4 and 3/7: three parts each, but quarters are larger than sevenths 3/4 1/4 1/4 1/4 1/4 3/7 1/7 1/7 1/7 1/7 1/7 1/7 1/7 same count of parts, 3 in each row quarters are bigger than sevenths, so 3/4 > 3/7 Same numerator: the smaller denominator wins
Three quarters against three sevenths
Comparing Fractions: Methods & Examples › Comparing Fractions with Same Numerator
3/4 = 9/12 and 5/6 = 10/12: in twelfths, 5/6 is one twelfth larger 3/4 1/4 1/4 1/4 1/4 = 9/12 5/6 1/6 1/6 1/6 1/6 1/6 1/6 = 10/12 LCD of 4 and 6 is 12 10/12 > 9/12, so 5/6 > 3/4 by one twelfth Common denominator: compare parts of one size
Comparing 3/4 and 5/6 in twelfths
Comparing Fractions: Methods & Examples › Common Denominator Method
Number line from 0 to 1 with the benchmark 1/2: 3/8 lies left of it, 5/9 right of it 0.25 0.5 0.75 1 3/8 5/9 benchmark 1/2 3 < 4: 3/8 is below one half 5 > 4.5: 5/9 is above one half One on each side of 1/2: no calculation needed Using 1/2 as a benchmark
Comparing Fractions: Methods & Examples › Benchmark Fractions
1/2 over 3/4: one half is 2 of the 3 quarters in 3/4, so the value is 2/3 3/4 1/4 1/4 1/4 1/4 1/2 = 2/4 1/4 1/4 1/4 1/4 1/2 covers 2 of the 3 quarters that make 3/4 (1/2)/(3/4) = 2/3; × 4/4 gives 2/3 directly How much of 3/4 is 1/2? Two thirds of it
What 1/2 over 3/4 measures
Complex Fractions: Simplify Stacked Fractions › Simplifying — Method 2: LCD
How many quarters fit in one half: two, so 1/2 divided by 1/4 is 2 1/2 1/2 1/2 1/4, 1/4 1/4 1/4 1/4 1/4 two quarters cover the same length as one half 1/2 ÷ 1/4 = 1/2 × 4 = 2 Division counts how many pieces fit
How many quarters fit in a half
Dividing Fractions: Keep Change Flip Method › Why Multiply by the Reciprocal
3/4 divided by 2: each quarter split in half, 3 of the 8 eighths, 3/8 3/4 1/4 1/4 1/4 1/4 ÷ 2 = 3/8 1/8 1/8 1/8 1/8 1/8 1/8 1/8 1/8 halving 3 quarters leaves 3 parts half as big 3/4 × 1/2 = 3/8 Dividing by a whole number makes the parts smaller
Three quarters divided by 2
Dividing Fractions: Keep Change Flip Method › Dividing Fractions by Whole Numbers
2/3, 4/6 and 8/12 shade the same length of equal wholes 2/3 1/3 1/3 1/3 4/6 1/6 1/6 1/6 1/6 1/6 1/6 8/12 each row cuts the parts of the row above in half the shaded length never changes: 2/3 = 4/6 = 8/12 Finer cuts, the same amount
Same amount, finer cuts
Equivalent Fractions: Simplify & Find Common Denominators › What Are Equivalent Fractions
252 = 105 · 2 + 42 105 = 42 · 2 + 21 42 = 21 · 2 + 0 stop gcd = 21 gcd(252, 105) = 21: the factor that reduces 105/252 to 5/12
Equivalent Fractions: Simplify & Find Common Denominators › Simplifying Fractions
Three number lines from 0 to 1 cut into halves, quarters and sixths: 1/2, 2/4 and 3/6 sit at the same point 0.5 1 1/2 2/4 3/6 halves quarters sixths Different labels, one point Equivalent fractions share one point
Equivalent Fractions: Simplify & Find Common Denominators › Equivalent Fractions on the Number Line
1/3 = 4/12 and 1/4 = 3/12: both rewritten in twelfths 1/3 1/3 1/3 1/3 = 4/12 1/4 1/4 1/4 1/4 1/4 = 3/12 12 is a multiple of both 3 and 4, so both fit into twelfths now the parts have the same size and can be compared or added A common denominator: one part size for both
Rewriting 1/3 and 1/4 in twelfths
Equivalent Fractions: Simplify & Find Common Denominators › Common Denominators
17/5 shaded as fifths: three full wholes and 2 fifths of a fourth, 3 2/5 17/5 17 ÷ 5 = 3 remainder 2 three full bars and 2 fifths more: 17/5 = 3 2/5 Quotient: whole bars; remainder: the leftover fifths
Seventeen fifths as a mixed number
Mixed Numbers & Improper Fractions: Conversions › Converting Improper Fractions to Mixed Numbers
Number line from 0 to 3 marked in fifths: 2 2/5 and 12/5 are the same point 1 2 3 2 2/5 = 12/5 each whole cut into fifths 2 wholes and 2 fifths = 12 fifths One point, two names 2 2/5 on the number line
Mixed Numbers & Improper Fractions: Conversions › Mixed Numbers on the Number Line
2/3 of 4/5: the unit square in 3 columns and 5 rows, the overlap is 8 of 15 cells 2/3 4/5 blue columns: 2/3 navy rows: 4/5 overlap: 2 · 4 = 8 cells of 3 · 5 = 15 cells 2/3 · 4/5 = 8/15 Numerators count the overlap, denominators the grid
Two thirds of four fifths
Multiplying Fractions: Rules, Examples & Cross-Canceling › Multiplying Fractions — Basic Rule
4 times 2/3 as four copies of 2/3, together 8 thirds = 2 2/3 2/3 1/3 1/3 1/3 + 2/3 1/3 1/3 1/3 + 2/3 1/3 1/3 1/3 + 2/3 1/3 1/3 1/3 = 8/3 4 copies of 2 thirds = 8 thirds = 2 2/3 A whole number times a fraction: repeated addition
Four times two thirds
Multiplying Fractions: Rules, Examples & Cross-Canceling › Multiplying Fractions by Whole Numbers
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 ★ 0 1 2 3 4 5 mod 6 Counting round a wheel of 6: the remainder is the slot you land on
Modulo: Remainders, Congruence & Clock Arithmetic › What is Modulo?
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 ★ 0 1 2 3 4 5 mod 6 Six slots, six possible remainders: 0 to 5
Modulo: Remainders, Congruence & Clock Arithmetic › The Range of Remainders
Number line scene (single track) 0 5 10 15 20 25 30 35 40 45 50 47 +5 +5 +5 +5 +5 +5 +5 +5 +5 remainder = 2 47 = 5 · 9 + 2 47 ÷ 5 = 9.4, keep 9 9 jumps of 5 reach 45 47 mod 5 = 2 Finding 47 mod 5 on a number line
Modulo: Remainders, Congruence & Clock Arithmetic › How to Compute a Remainder
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 ★ 0 1 2 3 4 5 mod 6 One slot holds 3, 9, 15, …: a congruence class
Modulo: Remainders, Congruence & Clock Arithmetic › Congruence
Number line with multiples of 3: for -7, truncation stops at -6 and leaves -1; flooring goes down to -9 and leaves 2 −12 −9 −6 −3 truncated: q = −2, r = −1 floored: q = −3, r = 2 (−7) mod 3, circles: multiples of 3 −7 Toward zero gives −1; toward −∞ gives 2 Two ways to divide −7 by 3
Modulo of Negative Numbers: Truncated vs Floored Division › Two Conventions
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 ★ 0 1 2 3 4 5 mod 6 One class, many representatives
Modulo of Negative Numbers: Truncated vs Floored Division › Congruence Perspective
The playing field mod 6: slots 0 to 5
Modular Arithmetic: Operations, Power Cycles & Applications › Operating Within a Modulus
Powers of 2 mod 7 for k = 1 to 9: 2, 4, 1 repeating with cycle length 3 k 2ᵏ mod 7 1 2 3 4 5 6 7 8 9 10 1 2 3 4 5 6 2, 4, 1, 2, 4, 1, 2, 4, 1, … amber: each new cycle starts 2¹⁰⁰: 100 = 3 · 33 + 1, so 2 Finitely many remainders force the powers to cycle The powers of 2 modulo 7 repeat
Modular Arithmetic: Operations, Power Cycles & Applications › Detecting Cycles in Powers
A 3 by 9 array of dots split after the fourth column: 3 times 9 = 27 equals 3 times 4 = 12 plus 3 times 5 = 15 3 · 4 = 12 3 · 5 = 15 together: 3 · (4 + 5) = 27 Split the columns, count each part, add The distributive property as an array
Properties of Arithmetic Operations › Distributive Property
÷1 ÷2 ÷3 ÷4 ÷5 ÷6 ÷7 ÷8 ÷9 ÷10 ÷11 ÷12 ✕ 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100
÷1 selected, frozen
Interactive Divisibility Table › Divisibility Rule for 1
÷1 ÷2 ÷3 ÷4 ÷5 ÷6 ÷7 ÷8 ÷9 ÷10 ÷11 ÷12 ✕ 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100
÷2 selected, frozen
Interactive Divisibility Table › Divisibility Rule for 2
÷1 ÷2 ÷3 ÷4 ÷5 ÷6 ÷7 ÷8 ÷9 ÷10 ÷11 ÷12 ✕ 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100
÷3 selected, frozen
Interactive Divisibility Table › Divisibility Rule for 3
÷1 ÷2 ÷3 ÷4 ÷5 ÷6 ÷7 ÷8 ÷9 ÷10 ÷11 ÷12 ✕ 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100
÷4 selected, frozen
Interactive Divisibility Table › Divisibility Rule for 4
÷1 ÷2 ÷3 ÷4 ÷5 ÷6 ÷7 ÷8 ÷9 ÷10 ÷11 ÷12 ✕ 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100
÷5 selected, frozen
Interactive Divisibility Table › Divisibility Rule for 5
÷1 ÷2 ÷3 ÷4 ÷5 ÷6 ÷7 ÷8 ÷9 ÷10 ÷11 ÷12 ✕ 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100
÷6 selected, frozen
Interactive Divisibility Table › Divisibility Rule for 6
÷1 ÷2 ÷3 ÷4 ÷5 ÷6 ÷7 ÷8 ÷9 ÷10 ÷11 ÷12 ✕ 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100
÷7 selected, frozen
Interactive Divisibility Table › Divisibility Rule for 7
÷1 ÷2 ÷3 ÷4 ÷5 ÷6 ÷7 ÷8 ÷9 ÷10 ÷11 ÷12 ✕ 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100
÷8 selected, frozen
Interactive Divisibility Table › Divisibility Rule for 8
÷1 ÷2 ÷3 ÷4 ÷5 ÷6 ÷7 ÷8 ÷9 ÷10 ÷11 ÷12 ✕ 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100
÷9 selected, frozen
Interactive Divisibility Table › Divisibility Rule for 9
÷1 ÷2 ÷3 ÷4 ÷5 ÷6 ÷7 ÷8 ÷9 ÷10 ÷11 ÷12 ✕ 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100
÷10 selected, frozen
Interactive Divisibility Table › Divisibility Rule for 10
÷1 ÷2 ÷3 ÷4 ÷5 ÷6 ÷7 ÷8 ÷9 ÷10 ÷11 ÷12 ✕ 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100
÷11 selected, frozen
Interactive Divisibility Table › Divisibility Rule for 11
÷1 ÷2 ÷3 ÷4 ÷5 ÷6 ÷7 ÷8 ÷9 ÷10 ÷11 ÷12 ✕ 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100
÷12 selected, frozen
Interactive Divisibility Table › Divisibility Rule for 12
÷1 ÷2 ÷3 ÷4 ÷5 ÷6 ÷7 ÷8 ÷9 ÷10 ÷11 ÷12 ✕ 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100
÷2 and ÷3 selected, frozen
Interactive Divisibility Table › Combining Divisors
23 tiles
23 tiles, ungrouped, frozen
Divisibility Tiles Interactive Visualizer › Understanding the Tiles Display
4 groups of 5 — Divisible ✓ 5 5 5 5
20 ÷ 5, frozen
Divisibility Tiles Interactive Visualizer › What is Divisibility?
4 groups of 5 + 3 leftover 5 5 5 5 +3
23 ÷ 5, frozen
Divisibility Tiles Interactive Visualizer › Division, Quotients, and Remainders
0 groups of 5 + 3 leftover +3
3 ÷ 5, frozen
Divisibility Tiles Interactive Visualizer › When the Divisor Is Larger Than the Number
N Even or Odd? EVEN ÷2 ✓ ÷4? ✓ ÷8? ✗ ÷8 ✗ ODD ÷2,4,6,8,10,12 ✗ ↓ merge ÷3? digit sum ÷3 ✓ ÷9? ÷3 ✗ ÷9 ✗ ÷5? ends 0/5 ÷7? ÷11? alt sum DERIVED ÷6 (2∧3) ÷10 (2∧5) ÷12 (3∧4)
No input, frozen
Divisibility Decision Tree Interactive Tool › How to Use the Decision Tree
26 Even or Odd? EVEN EVEN ÷2 ✓ ✓ ÷4? 26 ✗ ✓ ÷8? ✗ ÷8 ✗ ✗ ODD ÷2,4,6,8,10,12 ✗ ↓ merge ÷3? sum=8 ✗ ÷3 ✓ ÷9? ÷3 ✗ ÷9 ✗ ✗ ÷5? ends 6 ✗ ÷7? ✗ ÷11? alt=-4 ✗ DERIVED ÷6 (2∧3) ÷10 (2∧5) ÷12 (3∧4)
26 entered, frozen
Divisibility Decision Tree Interactive Tool › The Even/Odd Split
45 Even or Odd? ODD EVEN ÷2 ✓ ÷4? ✓ ÷8? ✗ ÷8 ✗ ODD ÷2,4,6,8,10,12 ✗ ✗ ↓ merge ÷3? sum=9 ✓ ÷3 ✓ ÷9? ✓ ÷3 ✗ ÷9 ✗ ÷5? ends 5 ✓ ÷7? ✗ ÷11? alt=-1 ✗ DERIVED ÷6 (2∧3) ÷10 (2∧5) ÷12 (3∧4)
45 entered, frozen
Divisibility Decision Tree Interactive Tool › The Odd Shortcut
104 Even or Odd? EVEN EVEN ÷2 ✓ ✓ ÷4? 4 ✓ ✓ ÷8? ✓ ✗ ÷8 ✗ ODD ÷2,4,6,8,10,12 ✗ ↓ merge ÷3? sum=5 ✗ ÷3 ✓ ÷9? ÷3 ✗ ÷9 ✗ ✗ ÷5? ends 4 ✗ ÷7? ✗ ÷11? alt=5 ✗ DERIVED ÷6 (2∧3) ÷10 (2∧5) ÷12 (3∧4)
104 entered, frozen
Divisibility Decision Tree Interactive Tool › The Powers of Two Chain
126 Even or Odd? EVEN EVEN ÷2 ✓ ✓ ÷4? 26 ✗ ✓ ÷8? ✗ ÷8 ✗ ✗ ODD ÷2,4,6,8,10,12 ✗ ↓ merge ÷3? sum=9 ✓ ÷3 ✓ ÷9? ✓ ÷3 ✗ ÷9 ✗ ÷5? ends 6 ✗ ÷7? ✓ ÷11? alt=5 ✗ DERIVED ÷6 (2∧3) ÷10 (2∧5) ÷12 (3∧4)
126 entered, frozen
Divisibility Decision Tree Interactive Tool › Digit Sum Rules for 3 and 9
50 Even or Odd? EVEN EVEN ÷2 ✓ ✓ ÷4? 50 ✗ ✓ ÷8? ✗ ÷8 ✗ ✗ ODD ÷2,4,6,8,10,12 ✗ ↓ merge ÷3? sum=5 ✗ ÷3 ✓ ÷9? ÷3 ✗ ÷9 ✗ ✗ ÷5? ends 0 ✓ ÷7? ✗ ÷11? alt=5 ✗ DERIVED ÷6 (2∧3) ÷10 (2∧5) ÷12 (3∧4)
50 entered, frozen
Divisibility Decision Tree Interactive Tool › When the Digit Sum Fails
13 Even or Odd? ODD EVEN ÷2 ✓ ÷4? ✓ ÷8? ✗ ÷8 ✗ ODD ÷2,4,6,8,10,12 ✗ ✗ ↓ merge ÷3? sum=4 ✗ ÷3 ✓ ÷9? ÷3 ✗ ÷9 ✗ ✗ ÷5? ends 3 ✗ ÷7? ✗ ÷11? alt=-2 ✗ DERIVED ÷6 (2∧3) ÷10 (2∧5) ÷12 (3∧4)
13 entered, frozen
Divisibility Decision Tree Interactive Tool › Only Divisible by 1: Prime Suspects
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100
Initial grid, frozen
Sieve of Eratosthenes Visualization › How to Use the Sieve Visualization
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 Sieve complete, frozen
Sieve of Eratosthenes Visualization › Understanding the Grid Display
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100
After the ÷2 sweep, frozen
Sieve of Eratosthenes Visualization › The First Pass: Multiples of 2
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 After the ÷3 sweep, frozen
Sieve of Eratosthenes Visualization › The Second Pass: Multiples of 3
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 After the ÷5 sweep, frozen
Sieve of Eratosthenes Visualization › Why Start at p²?
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 After the ÷7 sweep, frozen
Sieve of Eratosthenes Visualization › The Last Pass: Multiples of 7
252 = 105 · 2 + 42 105 = 42 · 2 + 21 42 = 21 · 2 + 0 stop gcd = 21 252 and 105, frozen
Euclidean Algorithm Visualizer › Getting Started with the Visualizer
36 = 36 · 1 + 0 stop gcd = 36
36 and 36, frozen
Euclidean Algorithm Visualizer › Why the Algorithm Works
462 = 198 · 2 + 66 198 = 66 · 3 + 0 stop gcd = 66 462 and 198, frozen
Euclidean Algorithm Visualizer › Short Chains: When a Remainder Divides Its Divisor
1071 = 462 · 2 + 147 462 = 147 · 3 + 21 147 = 21 · 7 + 0 stop gcd = 21 1071 and 462, frozen
Euclidean Algorithm Visualizer › The Textbook Example: 1071 and 462
54 = 35 · 1 + 19 35 = 19 · 1 + 16 19 = 16 · 1 + 3 16 = 3 · 5 + 1 3 = 1 · 3 + 0 stop gcd = 1 54 and 35, frozen
Euclidean Algorithm Visualizer › Coprime Pairs: When the GCD Is 1
144 = 89 · 1 + 55 89 = 55 · 1 + 34 55 = 34 · 1 + 21 34 = 21 · 1 + 13 21 = 13 · 1 + 8 13 = 8 · 1 + 5 8 = 5 · 1 + 3 5 = 3 · 1 + 2 3 = 2 · 1 + 1 2 = 1 · 2 + 0 stop gcd = 1 144 and 89, frozen
Euclidean Algorithm Visualizer › The Worst Case: Fibonacci Pairs
84 = 56 · 1 + 28 56 = 28 · 2 + 0 stop gcd = 28 84 and 56, frozen
Euclidean Algorithm Visualizer › Special Cases and Corner Behavior
mod 6, idle, frozen
Modular Arithmetic Wheel Visualizer › Getting Started
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 ★ 0 1 2 3 4 5 mod 6 mod 6, placing 17, frozen
Modular Arithmetic Wheel Visualizer › Run Controls and Speed
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 ★ 0 1 2 3 4 5 mod 6 mod 6, class 2 pinned, frozen
Modular Arithmetic Wheel Visualizer › Hovering and Pinning Classes
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 ★ 0 1 2 3 4 5 mod 6 mod 6, zero class pinned, frozen
Modular Arithmetic Wheel Visualizer › The Zero Class — Why It's Special
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 ★ 0 1 mod 2 mod 2, 20 placed, frozen
Modular Arithmetic Wheel Visualizer › Adjusting Divisor and Count
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 ★ 0 1 2 3 4 5 mod 6 mod 6, run complete, frozen
Modular Arithmetic Wheel Visualizer › Reading a Complete Run
Number: 100Base: 101 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 102 (100) ×1 101 (10) ×0 100 (1) ×0 100 in base 10 is: 100
100 in base 10, frozen
Base Conversion Visualizer › Decimal: Base 10
Number: 100Base: 21 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 26 (64) ×1 25 (32) ×1 24 (16) ×0 23 (8) ×0 22 (4) ×1 21 (2) ×0 20 (1) ×0 100 in base 2 is: 1100100
100 in base 2, frozen
Base Conversion Visualizer › Binary: Base 2
Number: 100Base: 81 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 82 (64) ×1 81 (8) ×4 80 (1) ×4 100 in base 8 is: 144
100 in base 8, frozen
Base Conversion Visualizer › Octal: Base 8
Number: 100Base: 161 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 161 (16) ×6 160 (1) ×4 100 in base 16 is: 64
100 in base 16, frozen
Base Conversion Visualizer › Hexadecimal: Base 16
Number: 100Base: 361 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 361 (36) ×2 360 (1) ×28 100 in base 36 is: 2S
100 in base 36, frozen
Base Conversion Visualizer › Base 36: Every Digit and Every Letter