Class 8 . Mathematics . Ganita Prakash Part I . Number Play

Chapter 5: Number Play

Ch 5

Mathematics

Class 8

Lecture 1

Sum of Consecutive Number Part-1

Reference video · Lecture 1Sum of Consecutive Number Part-1

Writing Numbers as Sums of Consecutive Numbers

Key examples and observations

  • Examples: 7=3+47=3+4, 10=1+2+3+410=1+2+3+4, and 12=3+4+512=3+4+5.
  • Multiple representations: 15=7+8=4+5+6=1+2+3+4+515=7+8=4+5+6=1+2+3+4+5.
  • Odd numbers: An odd number greater than 11 can be written as the sum of two consecutive positive integers.
  • Even numbers: Some even numbers can be written as sums of consecutive numbers, such as 1010 and 1212 above.
Odd number as two consecutive integers
N=N−12+N+12N=\frac{N-1}{2}+\frac{N+1}{2}

For an odd positive integer N>1N>1, the two consecutive positive integers are obtained by taking half a step below and above NN.

Worked example

Can a number have more than one representation as a sum of consecutive numbers?

  1. Write 1515 in the consecutive-sum forms shown in the examples.
    15=7+815=7+8
  2. It can also be expressed as three consecutive numbers.
    15=4+5+615=4+5+6
  3. A representation using five consecutive numbers is also possible.
    15=1+2+3+4+515=1+2+3+4+5
Answer: 1515 has three different consecutive-sum representations shown above.

Parity of Signed Sums

Parity rules

  • Same parity: Odd ±\pm odd and even ±\pm even are even; odd ±\pm even is odd.
  • Addition and subtraction: For any integers aa and bb, a+ba+b and a−ba-b have the same parity.
  • Sign switch: Changing +b+b to −b-b changes the expression by 2b2b in magnitude, an even number.
  • Consequence: Expressions made from the same numbers using different plus and minus signs all have the same parity.
Branching diagram of the possible sign choices for four numbers.
Branching diagram of the possible sign choices for four numbers.
Parity of signed sums

For fixed integers a,b,c,da,b,c,d, every expression a±b±c±da\pm b\pm c\pm d has the same parity as a+b+c+da+b+c+d. Switching any sign changes the value by an even number.

a±b±c±d≡a+b+c+d(mod2)a\pm b\pm c\pm d\equiv a+b+c+d\pmod{2}
Four consecutive numbers

Every signed expression formed from four consecutive integers is even, because their all-positive sum is even and all sign choices have the same parity.

n+(n+1)+(n+2)+(n+3)=4n+6=2(2n+3)n+(n+1)+(n+2)+(n+3)=4n+6=2(2n+3)

Proving that sign choices have the same parity

  1. Start with one signed expression.
    a+b−c−da+b-c-d
  2. Switch the sign of bb and compare the expressions.
    (a+b−c−d)−(a−b−c−d)=2b(a+b-c-d)-(a-b-c-d)=2b
  3. The change is even, so the parity is unchanged; repeat for each sign that differs.
    2b≡0(mod2)2b\equiv 0\pmod{2}
Worked example

What parity do the signed expressions formed from 3,4,5,63,4,5,6 have?

  1. Use the four consecutive numbers 3,4,5,63,4,5,6. Fix the first number as positive; the other three signs give eight choices.
    23=82^3=8
  2. Evaluate all eight expressions.
    3+4+5+6=183+4+5−6=63+4−5+6=83+4−5−6=−43−4+5+6=103−4+5−6=−23−4−5+6=03−4−5−6=−12\begin{aligned}3+4+5+6&=18&3+4+5-6&=6\\3+4-5+6&=8&3+4-5-6&=-4\\3-4+5+6&=10&3-4+5-6&=-2\\3-4-5+6&=0&3-4-5-6&=-12\end{aligned}
  3. Each result is even, as expected for four consecutive numbers.
    18,6,8,−4,10,−2,0,−12≡0(mod2)18,6,8,-4,10,-2,0,-12\equiv 0\pmod{2}
Answer: All eight results are even.
⚠ Common mistake

Do not assume signed sums of any four numbers are always even. They all have the same parity, but that parity depends on the all-positive sum, which may be odd or even.

Practice

If a negative sign in a+b−c−da+b-c-d is changed to a positive sign, how does the value change?

Hint: Compare the expression before and after changing the sign of cc.
Key step: (a+b+c−d)−(a+b−c−d)=2c(a+b+c-d)-(a+b-c-d)=2c.
Solution: The value increases by 2c2c, an even integer; therefore, its parity stays the same.
Practice

What can be said about the parity of all expressions a±b±c±da\pm b\pm c\pm d?

Hint: Compare each expression with the all-positive sum.
Key step: a±b±c±d≡a+b+c+d(mod2)a\pm b\pm c\pm d\equiv a+b+c+d\pmod{2}.
Solution: They all have the same parity as a+b+c+da+b+c+d, since every sign switch changes the value by an even number.
Practice

Explain why every signed expression formed from four consecutive integers is even.

Hint: Write the numbers as n,n+1,n+2,n+3n,n+1,n+2,n+3.
Key step: n+(n+1)+(n+2)+(n+3)=4n+6n+(n+1)+(n+2)+(n+3)=4n+6, which is even.
Solution: The all-positive sum is even. Every sign switch changes the value by an even number, so every signed expression is even.

Quick recap

  • Consecutive numbers follow one another, and a number can have more than one consecutive-sum representation.
  • An odd positive integer greater than 11 is the sum of two consecutive positive integers.
  • Switching the sign of a term changes a signed sum by an even number.
  • All sign combinations of the same numbers have the same parity.
  • The signed expressions from four consecutive integers are all even.
Lecture 2

Sum of Consecutive Number Part-2

Reference video · Lecture 2Sum of Consecutive Number Part-2

Breaking Even

Checking numerical expressions by parity
ExpressionParity
43+3743+37Even
672−348672-348Even
4×347×34\times347\times3Even
708−477708-477Odd
809+214809+214Odd
119×303119\times303Odd
543−479543-479Even
5133513^3Odd
Factor test for evenness
E=2k,k∈ZE=2k,\quad k\in\mathbb{Z}

Use this when the expression can be factored to show a factor of 22.

Test whether an expression is always even

  1. Factor the expression, if possible, and check whether it has a factor of 22.
  2. If it does not, examine the variables' parity or test integer values.
  3. One odd result is enough to show that the expression is not always even.
Worked example

Why is 4m+2q4m+2q always even, and what is its value when m=4m=4 and q=−9q=-9?

  1. Show that 4m+2q4m+2q is always even, then evaluate it for m=4m=4 and q=−9q=-9.
  2. Factor out 22; the remaining expression is an integer for integer m,qm,q.
    4m+2q=2(2m+q)4m+2q=2(2m+q)
  3. Substitute the given values and simplify.
    4(4)+2(−9)=16−18=−24(4)+2(-9)=16-18=-2
Answer: 4m+2q4m+2q is always even because it has a factor of 22; the stated value is −2-2.
⚠ Common mistake

Do not decide an expression is always even from one even example; test its structure or find a counterexample with an odd result.

Pairs to Make Fours

Definition

Even numbers modulo 4 — Every even number is either a multiple of 44 or is 22 more than a multiple of 44.

Dot arrangements show the two forms of even numbers: multiples of 4 and numbers leaving remainder 2 on division by 4.
Dot arrangements show the two forms of even numbers: multiples of 44 and numbers leaving remainder 22 on division by 44.
Sum of two even numbers

Two even numbers add to a multiple of 44 when both are multiples of 44 or both leave remainder 22 when divided by 44. If they are of different types, their sum leaves remainder 22.

4p+4q=4(p+q),(4p+2)+(4q+2)=4(p+q+1),4p+(4q+2)=4(p+q)+24p+4q=4(p+q),\quad (4p+2)+(4q+2)=4(p+q+1),\quad 4p+(4q+2)=4(p+q)+2
Dot arrays illustrate that adding two even numbers of the same type gives a multiple of 4.
Dot arrays illustrate that adding two even numbers of the same type gives a multiple of 44.
Combining 4p and 4q+2 gives 4(p+q)+2, so the sum is even but not a multiple of 4.
Combining 4p4p and 4q+24q+2 gives 4(p+q)+24(p+q)+2, so the sum is even but not a multiple of 44.
Two forms of even numbers
4por4p+24p\quad\text{or}\quad 4p+2

Here pp and qq are integers.

Decide whether two even numbers sum to a multiple of 44

  1. Write each even number as either 4p4p or 4p+24p+2.
  2. If both have the same form, their sum is divisible by 44.
  3. If they have different forms, the sum has remainder 22 when divided by 44.
Worked example

Is the sum of 1414 and 2222 divisible by 44?

  1. Check whether 14+2214+22 is divisible by 44.
  2. Write each addend in the form 4p+24p+2.
    14=4(3)+2,22=4(5)+214=4(3)+2,\quad 22=4(5)+2
  3. Add and factor the result as a multiple of 44.
    (4⋅3+2)+(4⋅5+2)=4(3+5+1)=36(4\cdot3+2)+(4\cdot5+2)=4(3+5+1)=36
Answer: Yes. 14+22=3614+22=36, which is divisible by 44.
Practice

Is 6m−3n6m-3n always even for integers m,nm,n?

Hint: Try integer values that make nn odd.
Key step: Use m=0m=0 and n=1n=1 as a test.
Solution: No. For m=0,n=1m=0,n=1, 6m−3n=−36m-3n=-3, which is odd.
Practice

Do 1818 and 2626 add to a multiple of 44?

Hint: Write each number as a multiple of 44 plus a remainder.
Key step: 18=4(4)+218=4(4)+2 and 26=4(6)+226=4(6)+2 have the same form.
Solution: Yes. 18+26=44=4(11)18+26=44=4(11).
★ Remember
  • A factor of 22 proves an integer expression is even.
  • Two even numbers sum to a multiple of 44 when they have the same remainder on division by 44.

Quick recap

  • An integer expression with a factor of 22 is always even.
  • A single odd output disproves a claim that an expression is always even.
  • x2x^2 has the same parity as xx.
  • Every even number has the form 4p4p or 4p+24p+2.
  • Two even numbers of the same form add to a multiple of 44.
  • Adding one number of each form gives remainder 22 modulo 44.
Lecture 3

Sum of Consecutive Number Part-3

Reference video · Lecture 3Sum of Consecutive Number Part-3

Divisibility: Always, Sometimes, or Never

Divisibility properties

If aa divides both MM and NN, then it divides their sum and difference. If AA is divisible by kk, every multiple of AA is divisible by kk, and AA is divisible by every factor of kk.

a∣M and a∣N  ⟹  a∣(M+N) and a∣(M−N)a\mid M\text{ and }a\mid N\implies a\mid(M+N)\text{ and }a\mid(M-N)
Common divisors and the LCM

If a number AA is divisible by both kk and mm, then AA is divisible by LCM⁡(k,m)\operatorname{LCM}(k,m), since its prime factorisation contains all the prime factors required by that LCM.

k∣A and m∣A  ⟹  LCM⁡(k,m)∣Ak\mid A\text{ and }m\mid A\implies \operatorname{LCM}(k,m)\mid A

Parity and divisibility examples

  • Odd plus even: The result is odd, so it can never be a multiple of 66, since every multiple of 66 is even.
  • Two even numbers: Their sum is sometimes a multiple of 33; for instance, 2+4=62+4=6, while 2+2=42+2=4.
  • Not divisible by 1818: It may still be divisible by 99 (for example, 99), so the statement that it is not divisible by 99 is sometimes true.
  • Two numbers not divisible by 66: Their sum may or may not be divisible by 66; for example, 1+2=31+2=3 but 1+5=61+5=6.
  • Multiple of 66 plus multiple of 99: The sum is always a multiple of 33; a multiple of 66 plus a multiple of 33 is only sometimes a multiple of 99.
Sum and difference of multiples
M+N=a(p+q),M−N=a(p−q)M+N=a(p+q),\qquad M-N=a(p-q)

Write multiples as M=apM=ap and N=aqN=aq to apply the sum and difference rule.

Test an always/sometimes/never claim

  1. Translate the divisibility condition into a multiple or factor statement.
  2. Use a general rule to prove the claim, or find examples and counterexamples.
  3. Classify it as always true, sometimes true, or never true.
Worked example

Is the statement always true, sometimes true, or never true?

  1. Classify: If a number is divisible by both 66 and 44, it must be divisible by 2424.
  2. Find the least common multiple of the two divisors.
    LCM⁡(6,4)=12\operatorname{LCM}(6,4)=12
  3. Every common multiple must be divisible by 1212, but 1212 is not divisible by 2424; the number 2424 does work.
    12≢0(mod24),24≡0(mod24)12\not\equiv 0\pmod{24},\qquad 24\equiv 0\pmod{24}
  4. Thus the claim works for some numbers but not all.
Answer: Sometimes true.
⚠ Common mistake

Being divisible by two numbers guarantees divisibility by their LCM, not necessarily by their product; for example, divisibility by 66 and 44 only guarantees divisibility by 1212.

Representing Numbers by Their Remainders

Definition

Remainder form — A number that leaves remainder rr when divided by dd is dd times a whole-number quotient, plus rr.

Division algorithm

For a non-negative integer NN, division by a positive integer dd gives N=dq+rN=dq+r, where qq is a whole number and 0≤r<d0\le r<d.

N=dq+r,0≤r<dN=dq+r,\qquad 0\le r<d
Remainder 3 when divided by 5
N=5k+3 (k≥0),N=5k−2 (k≥1)N=5k+3\ (k\ge0),\qquad N=5k-2\ (k\ge1)

Such numbers are 33 more than multiples of 55. The equivalent form 5k−25k-2 uses k≥1k\ge1.

Key remainder patterns

  • Remainder 00 on division by 55: The number is a multiple of 55, of the form 5k5k.
  • Remainder 33 on division by 55: The number is of the form 5k+35k+3; examples are 3,8,13,18,23,…3,8,13,18,23,\ldots.
  • Equivalent pattern: The same numbers are 22 less than multiples of 55, so they can also be written as 5k−25k-2 for k≥1k\ge1.

Write a number pattern from a remainder

  1. Identify the divisor dd and the required remainder rr.
  2. Write the number as the divisor times a whole-number quotient, plus the remainder.
    N=dq+rN=dq+r
  3. Check that the remainder is less than the divisor.
    0≤r<d0\le r<d
Worked example

What algebraic expression describes the numbers?

  1. Write all non-negative numbers that leave remainder 33 on division by 55.
  2. Use the divisor and remainder in the division form.
    N=5k+3,k≥0N=5k+3,\qquad k\ge0
  3. Substitute successive whole-number values for kk.
    k=0,1,2,3  ⟹  N=3,8,13,18k=0,1,2,3\implies N=3,8,13,18
Answer: 5k+35k+3 for k≥0k\ge0.

Consecutive Numbers and Combined Conditions

Definition

Consecutive integers — Consecutive integers follow one another with a difference of 11.

Consecutive-number forms
n,n+1,n+2,n+3p−4,p−3,p−2,p−1,p\begin{aligned}n,n+1,n+2,n+3\\p-4,p-3,p-2,p-1,p\end{aligned}

For four consecutive integers, start with nn; for five consecutive integers whose greatest is pp, work backwards from pp.

Same remainder for different divisors

A number that leaves remainder 22 when divided by both 33 and 44 is 22 more than a common multiple of 33 and 44; hence it has the form 12k+212k+2.

N=LCM⁡(3,4)k+2=12k+2N=\operatorname{LCM}(3,4)k+2=12k+2

Solve simultaneous remainder conditions

  1. Translate each remainder condition into a congruence or a divisibility statement.
  2. Combine compatible conditions using common multiples or by testing the resulting pattern.
  3. Check the smallest candidates against every condition before stating the least solution.
Worked example

The sum of four consecutive numbers is 3434. Find the numbers.

  1. Let four consecutive integers be represented by a starting number and the next three integers.
    n, n+1, n+2, n+3n,\ n+1,\ n+2,\ n+3
  2. Set their sum equal to 3434 and simplify.
    n+(n+1)+(n+2)+(n+3)=34  ⟹  4n+6=34n+(n+1)+(n+2)+(n+3)=34\implies 4n+6=34
  3. Solve for the starting integer.
    4n=28  ⟹  n=74n=28\implies n=7
  4. List the four consecutive integers.
    7, 8, 9, 107,\ 8,\ 9,\ 10
Answer: 7,8,9,107,8,9,10.

Useful combined-remainder results

  • Remainders 22 on division by both 33 and 44: All such numbers are 12k+212k+2.
  • Remainders 2,3,42,3,4 on division by 3,4,53,4,5: The number plus 11 is divisible by all three divisors, so it is a multiple of 6060; the least positive solution is 5959.
  • Remainder arithmetic modulo 77: If 661661 leaves remainder 33 and 47794779 leaves remainder 55, their sum leaves remainder 11, and their difference leaves remainder 22.
  • Pebble puzzle: The number is odd, leaves remainder 11 on division by both 33 and 55, is divisible by 77, and is below 100100; the solution is 9191.
Practice

Classify each claim as always, sometimes, or never true: (a) the sum of a multiple of 66 and a multiple of 99 is a multiple of 33; (b) the sum of a multiple of 66 and a multiple of 33 is a multiple of 99; (c) two numbers not divisible by 66 have a sum not divisible by 66.

Hint: Use examples and counterexamples; for (a), use the common factor of 66 and 99.
Key step: For (a), both addends are multiples of 33. For (b) and (c), find one example that works and one that does not.
Solution: (a) Always: 6a+9b=3(2a+3b)6a+9b=3(2a+3b). (b) Sometimes: 6+3=96+3=9, but 6+6=126+6=12. (c) Sometimes: 1+2=31+2=3, but 1+5=61+5=6.
Practice

A number is below 100100, odd, divisible by 77, and leaves remainder 11 on division by both 33 and 55. Find it.

Hint: Check odd multiples of 77 below 100100, then test the two remainders.
Key step: Among the odd multiples of 77 below 100100, 9191 gives remainder 11 on division by both 33 and 55.
Solution: 9191: it is odd, 91=7×1391=7\times13, 91=3×30+191=3\times30+1, and 91=5×18+191=5\times18+1.
Practice

(a) Three numbers each leave remainder 22 when divided by 66. Must their sum be divisible by 66? (b) Find the least positive number leaving remainders 2,3,42,3,4 on division by 3,4,53,4,5, respectively.

Hint: For (a), add the three remainder forms. For (b), add 11 to the number and use the common multiple of 3,4,53,4,5.
Key step: Write the numbers in (a) as 6a+26a+2, 6b+26b+2, and 6c+26c+2; for (b), the number plus 11 must be divisible by 33, 44, and 55.
Solution: (a) Yes: the sum is 6(a+b+c+1)6(a+b+c+1), a multiple of 66. (b) The number plus 11 is a multiple of 6060, so the least positive answer is 60−1=5960-1=59.

Quick recap

  • If aa divides two numbers, it divides both their sum and their difference.
  • A number divisible by two divisors is divisible by their LCM.
  • A number with remainder rr on division by dd has the form dq+rdq+r, where 0≤r<d0\le r<d.
  • Remainder 33 on division by 55 is represented by 5k+35k+3 or, for k≥1k\ge1, by 5k−25k-2.
  • Represent consecutive integers using a starting variable plus successive increments of 11.
  • Combine remainder conditions using common multiples, and check candidates against every condition.
Lecture 4

Checking Divisibility Quickly

Reference video · Lecture 4Checking Divisibility Quickly

Divisibility by 2, 4, 5 and 10

Definition

Place-value form — A number can be written as a sum of its place values; its final digit is the units digit.

Last-digit and last-digits tests

Write N=10q+aN=10q+a, where aa is the units digit. The remaining place-value part is divisible by 1010, so the units digit determines divisibility by 22, 55 and 1010. For 44 and 88, use the last two and last three digits respectively, since 100100 is divisible by 44 and 10001000 by 88.

Place-value tests
N=10q+a,N=100q+r,N=1000q+sN=10q+a,\qquad N=100q+r,\qquad N=1000q+s

Use these decompositions to see why only the final digit or digits need checking.

Worked example

Which of 22, 44, 55, 88 and 1010 divide 40754075?

  1. Check the relevant final digits of 40754075.
    40754075
  2. Its units digit is 55: it is divisible by 55, but not by 22 or 1010.
    5≠05\ne 0
  3. Its final two digits are 7575, and its final three digits are 075075; neither meets the test for 44 or 88.
    75≢0(mod4),75≢0(mod8)75\not\equiv 0\pmod 4,\qquad 75\not\equiv 0\pmod 8
Answer: 40754075 is divisible by 55 only.

Divisibility and Remainders for 9

Definition

Digit-sum test for 9 — A whole number is divisible by 99 if and only if the sum of its digits is divisible by 99.

Why the digit-sum test works

Each place value leaves remainder 11 when divided by 99, so a number and its digit sum have the same remainder upon division by 99.

Remainder and digit sum
N≡sum of digits of N(mod9)N\equiv \text{sum of digits of }N\pmod 9

The number and its digit sum have the same remainder modulo 99.

Find divisibility or the remainder for 9

  1. Add the digits of the number.
  2. For divisibility, check whether the digit sum is a multiple of 99.
  3. For the remainder, divide the digit sum by 99 and use its remainder; you may repeat digit-summing to simplify.
  4. A final digit sum of 99 means remainder 00, not remainder 99.
Worked example

Find the remainders when 427427 and 73097309 are divided by 99.

  1. For 427427, add the digits to get 1313.
    4+2+7=134+2+7=13
  2. Since 1313 leaves remainder 44 when divided by 99, so does 427427.
    13=9+4,427≡4(mod9)13=9+4,\qquad 427\equiv 4\pmod 9
  3. For 73097309, add the digits to get 1919, then add those digits to get 1010.
    7+3+0+9=19,1+9=107+3+0+9=19,\qquad 1+9=10
  4. The digit sum 1010 leaves remainder 11 when divided by 99, so does 73097309.
    10=9+1,7309≡1(mod9)10=9+1,\qquad 7309\equiv 1\pmod 9
Answer: 427427 leaves remainder 44; 73097309 leaves remainder 11.
⚠ Common mistake

Do not conclude that a final digit sum of 99 gives remainder 99; it gives remainder 00. Divisibility by 99 and divisibility of the digit sum by 99 are equivalent, so both their converse statements are also true.

Practice

Without dividing, determine which of 123123, 405405, 88888888, 9354793547 and 358095358095 are divisible by 99.

Hint: Add the digits of each number.
Key step: The digit sums are 66, 99, 3232, 2828 and 3030.
Solution: Only 405405 is divisible by 99, since only its digit sum, 99, is a multiple of 99.
Practice

Find the smallest positive multiple of 99 with no odd digits, and the multiple of 99 closest to 60006000.

Hint: Use the digit-sum test; compare multiples just below and above 60006000.
Key step: The smallest positive number using only even digits with digit sum divisible by 99 is 288288. Nearby multiples of 99 are 59945994 and 60036003.
Solution: The smallest positive multiple is 288288. The closest multiple to 60006000 is 60036003, which is 33 away.
Practice

How many multiples of 99 are there strictly between 43004300 and 44004400?

Hint: Find the first and last multiples in the interval, then count them inclusively.
Key step: They run from 4302=9×4784302=9\times478 to 4392=9×4884392=9\times488.
Solution: There are 488−478+1=11488-478+1=11 multiples of 99.

Quick recap

  • Use the units digit to test divisibility by 22, 55 and 1010.
  • Use the last two digits for divisibility by 44 and the last three digits for divisibility by 88.
  • A number is divisible by 99 exactly when its digit sum is divisible by 99.
  • A number and its digit sum leave the same remainder upon division by 99.
  • Repeated digit-summing is valid; a final digit sum of 99 means remainder 00.
Lecture 5

A Shortcut for Divisibility by 3

Reference video · Lecture 5A Shortcut for Divisibility by 3

Divisibility by 3

Definition

Divisibility test for 3 — A whole number is divisible by 33 exactly when the sum of its digits is divisible by 33.

Key points

  • Reason: Since 10≡1(mod3)10 \equiv 1 \pmod{3}, every power of 1010 is also congruent to 11 modulo 33. The number and its digit sum therefore have the same remainder when divided by 33.
  • Relation to 9: Every number divisible by 99 is divisible by 33, but the reverse is not always true; for example, 1515, 3333, and 8787 are divisible by 33 but not by 99.
Digit-sum rule
N≡d0+d1+⋯+dk(mod3)N \equiv d_0+d_1+\cdots+d_k \pmod{3}

The number and its digit sum have the same remainder modulo 33.

Test a number for divisibility by 3

  1. Add all the digits of the number.
  2. Check whether the digit sum is a multiple of 33.
  3. If it is, the original number is divisible by 33; otherwise, it is not.
Worked example

Is 735735 divisible by 33?

  1. Add the digits of 735735.
    7+3+5=157+3+5=15
  2. Since 1515 is divisible by 33, 735735 is also divisible by 33.
Answer: 735735 is divisible by 33.

Divisibility by 11

Powers of 10 alternate between one more and one less than a multiple of 11.
Powers of 1010 alternate between one more and one less than a multiple of 1111.
Definition

Divisibility test for 11 — A number is divisible by 1111 exactly when its alternating sum of digits is a multiple of 1111.

Key points

  • Reason: Since 10≡−1(mod11)10 \equiv -1 \pmod{11}, powers of 1010 alternate between 11 and −1-1 modulo 1111. The number and its alternating sum therefore have the same remainder modulo 1111.
  • Place values: Hundreds are 11 more than a multiple of 1111; tens are 11 less. The pattern continues, alternating for higher place values.
  • Example: For 462462, the alternating sum from the units digit is 2−6+4=02-6+4=0, so 462462 is divisible by 1111.
A visual test for divisibility by 11 compares the sums of digits in alternating positions.
A visual test for divisibility by 1111 compares the sums of digits in alternating positions.
Alternating-sum rule
N≡d0−d1+d2−⋯+(−1)kdk(mod11)N \equiv d_0-d_1+d_2-\cdots+(-1)^k d_k \pmod{11}

Start with the units digit and alternate plus and minus signs. The result gives the same remainder modulo 1111 as the original number.

Test a number for divisibility by 11

  1. Starting from the units digit, assign alternating plus and minus signs.
  2. Calculate the signed sum.
  3. If the result is a multiple of 1111, the number is divisible by 1111.
  4. For the remainder, add or subtract multiples of 1111 until the result is between 00 and 1010.
Worked example

What is the remainder when 328105328105 is divided by 1111?

  1. Find the remainder when 328105328105 is divided by 1111.
  2. Form the alternating sum, starting at the units digit.
    −3+2−8+1−0+5=−3-3+2-8+1-0+5=-3
  3. Add 1111 to obtain a remainder between 00 and 1010.
    −3+11=8-3+11=8
Answer: The remainder is 88; hence 328105328105 is not divisible by 1111.
Quick divisibility tests
DivisorQuick test
22The units digit is even.
33The sum of the digits is divisible by 33.
44The number formed by the last two digits is divisible by 44.
55The units digit is 00 or 55.
66The number is divisible by both 22 and 33.
88The number formed by the last three digits is divisible by 88.
99The sum of the digits is divisible by 99.
1010The units digit is 00.
1111The alternating sum of the digits is divisible by 1111.
Practice

Is 54125412 divisible by 33?

Hint: Add its digits.
Key step: The digit sum is 5+4+1+2=125+4+1+2=12.
Solution: 1212 is divisible by 33, so 54125412 is divisible by 33.
Practice

Find the remainder when 841841 is divided by 1111.

Hint: Alternate signs from the units digit.
Key step: The alternating sum is 1−4+8=51-4+8=5.
Solution: The remainder is 55.
Practice

For 30603060, decide divisibility by 2,3,4,5,6,8,9,10,2,3,4,5,6,8,9,10, and 1111.

Hint: Use the relevant final-digit, final-digits, digit-sum, and alternating-sum tests.
Key step: The digit sum is 99; the alternating sum from the units digit is −9-9.
Solution: Divisible by 2,3,4,5,6,9,2,3,4,5,6,9, and 1010; not divisible by 88 or 1111. The remainder modulo 1111 is 22.

Quick recap

  • A number is divisible by 33 when its digit sum is divisible by 33.
  • The digit-sum test works because 10≡1(mod3)10 \equiv 1 \pmod{3}.
  • For divisibility by 1111, alternate plus and minus signs across the digits, starting at the units digit.
  • A multiple-of-1111 alternating sum means the original number is divisible by 1111.
  • The alternating sum gives the remainder modulo 1111; adjust by multiples of 1111 to get a remainder from 00 to 1010.
  • Use final digits and digit sums for quick tests of divisibility by 2,3,4,5,6,8,9,2,3,4,5,6,8,9, and 1010.
Lecture 6

More on Divisibility Shortcuts/Divisibility Shortcuts for Other Numbers

Reference video · Lecture 6More on Divisibility Shortcuts/Divisibility Shortcuts for Other Numbers

Divisibility Shortcuts for Other Numbers

Coprime-factor divisibility test
gcd⁡(a,b)=1,ab∣n  ⟺  (a∣n)∧(b∣n)\gcd(a,b)=1,\quad ab\mid n\iff(a\mid n)\land(b\mid n)

Use when the target number can be split into coprime factors.

Test divisibility using factors

  1. Split the target into coprime factors.
    N=ab,gcd⁡(a,b)=1N=ab,\quad \gcd(a,b)=1
  2. Apply a known divisibility test to each factor.
    a∣nandb∣na\mid n\quad\text{and}\quad b\mid n
  3. If both tests pass, the number is divisible by the target.
    ab∣nab\mid n
Worked example

Is 186186 divisible by 66?

  1. Check whether 186186 is divisible by 6=2×36=2\times3.
    6=2×36=2\times3
  2. The last digit is even, so 186186 is divisible by 22.
    186÷2=93186\div2=93
  3. The digit sum is divisible by 33.
    1+8+6=15,15÷3=51+8+6=15,\quad 15\div3=5
  4. Both coprime factors divide the number, so 66 divides 186186.
    6∣1866\mid186
Answer: Yes. It is divisible by both 22 and 33.
⚠ Common mistake

Do not assume divisibility by two non-coprime factors guarantees divisibility by their product: 1212 is divisible by 44 and 66, but not by 2424.

Practice

Which of 38,225,186,38, 225, 186, and 6464 are divisible by 66?

Hint: A number must be even and have a digit sum divisible by 33.
Key step: 186186 is even and its digit sum is 1515; the other numbers fail at least one test.
Solution: Only 186186 is divisible by 66.

Digital Roots

Digital root and remainders

A number and its digit sum have the same remainder when divided by 99; repeated digit sums preserve this. The digital root also gives the same remainder as the number when divided by 33. For positive numbers, remainder 00 corresponds to digital root 99.

Digital-root patterns

  • Consecutive numbers: Digital roots cycle through 1,2,3,4,5,6,7,8,91,2,3,4,5,6,7,8,9, then repeat.
  • Multiples of 99: Every positive multiple of 99 has digital root 99.
  • Multiples of 33: Their digital roots cycle as 3,6,93,6,9.
  • Multiples of 44: Their digital roots cycle as 4,8,3,7,2,6,1,5,94,8,3,7,2,6,1,5,9.
  • Multiples of 66: Their digital roots cycle as 6,3,96,3,9.
  • One more than a multiple of 66: The digital roots cycle as 1,7,41,7,4.
  • Parity: Digital root does not determine whether a number is even or odd; for example, 11 and 1010 both have digital root 11 but different parity.
Digital root from the remainder modulo 99
dr⁡(n)={0,n=09,n>0 and n≡0(mod9)n mod 9,n≢0(mod9)\operatorname{dr}(n)=\begin{cases}0,&n=0\\9,&n>0\text{ and }n\equiv0\pmod9\\n\bmod9,&n\not\equiv0\pmod9\end{cases}

For positive nn, a remainder of 00 gives digital root 99; otherwise, the digital root is the remainder. The digital root of 00 is 00.

Find a digital root

  1. Add the digits of the number.
    ∑digits\sum \text{digits}
  2. If the sum has more than one digit, add its digits again.
    repeat digit sums until one digit remains\text{repeat digit sums until one digit remains}
  3. The final single digit is the digital root.
    dr⁡(n)\operatorname{dr}(n)
Worked example

Find the digital root of 489710489710 and of 1010 more than this number.

  1. Find the digital root of 489710489710.
    4+8+9+7+1+0=294+8+9+7+1+0=29
  2. Add the digits of the sum until one digit remains.
    2+9=11,1+1=22+9=11,\quad 1+1=2
  3. The digital root is 22; adding 1010 advances the remainder modulo 99 by 11.
    489710≡2(mod9),10≡1(mod9)489710\equiv2\pmod9,\quad 10\equiv1\pmod9
  4. Therefore, the digital root of 489720489720 is 33.
    489720≡3(mod9)489720\equiv3\pmod9
Answer: The digital roots are 22 and 33, respectively.
Change in digital root after adding a fixed amount
(n+k)≡n+(k mod 9)(mod9)(n+k)\equiv n+(k\bmod9)\pmod9

Adding kk changes the remainder modulo 99 by the remainder of kk modulo 99; digital roots then follow the 11-to-99 cycle.

Numbers strictly between 600600 and 700700 with the given digital roots
Digital rootNumbers
55608,617,626,635,644,653,662,671,680,689,698608,617,626,635,644,653,662,671,680,689,698
77601,610,619,628,637,646,655,664,673,682,691601,610,619,628,637,646,655,664,673,682,691
33606,615,624,633,642,651,660,669,678,687,696606,615,624,633,642,651,660,669,678,687,696
Practice

A sequence starts at a number with digital root 55 and repeatedly adds 1111. Find its first four digital roots.

Hint: Since 11≡2(mod9)11\equiv2\pmod9, advance by 22 around the digital-root cycle each time.
Key step: 5→7→9→25\to7\to9\to2.
Solution: The first four digital roots are 5,7,9,25,7,9,2.
Practice

Find the digital root of 9a+36b+139a+36b+13. Also, find the digital root of 1010 more than an 88-digit number with digital root 55.

Hint: Reduce each expression modulo 99; 9a9a and 36b36b are multiples of 99.
Key step: 9a+36b+13≡4(mod9)9a+36b+13\equiv4\pmod9, and adding 1010 advances the digital root by 11.
Solution: The digital roots are 44 and 66, respectively. A digital root gives remainders modulo 99 and 33, but does not determine parity.

Quick recap

  • For coprime factors, testing divisibility by each factor is enough: use 22 and 33 for 66, and 33 and 88 for 2424.
  • Testing 44 and 66 does not guarantee divisibility by 2424, because they share a factor of 22.
  • A digital root is found by repeatedly adding digits and tracks the number's remainder modulo 99.
  • Digital roots of consecutive numbers repeat in the cycle 11 through 99; positive multiples of 99 have digital root 99.
  • Adding 1111 advances a digital root by 22; digital root does not determine parity.
Lecture 7

Digits in Disguise

Reference video · Lecture 7Digits in Disguise

Cryptarithms

Definition

Cryptarithm — A number puzzle in which each letter represents one fixed digit, different letters represent different digits, and a number cannot begin with zero.

Place-value principle

Write each letter-number using place value; for example, the two-digit number AB‾\overline{AB} equals 10A+B10A+B.

AB‾=10A+B,ABC‾=100A+10B+C\overline{AB}=10A+B,\quad \overline{ABC}=100A+10B+C

Useful cryptarithm reasoning

  • Columns: Start with the units column and track any carry into the next column.
  • Range: A two-digit number multiplied by 88 stays two-digit only if the number is at most 1212; for example, 12×8=9612\times8=96 but 13×8=10413\times8=104.
  • Units digit: Match the units digits first. In GH×H=9KGH\times H=9K, the multiplier HH is also the units digit of GHGH.
  • Leading digit: In BYE×6=RAYBYE\times6=RAY, a three-digit product requires B=1B=1. Also, YY must be even and less than 77.
  • Distinctness: Reject any arithmetic solution that assigns the same digit to different letters.

Solving a cryptarithm

  1. Write each number using its place value.
  2. Use the units column and possible carries to restrict the digits.
  3. Use the number of digits and the leading-digit rule to narrow the choices.
  4. Check the arithmetic and confirm that different letters have different digits.
Worked example

Find the digits in A1+1B=B0A1+1B=B0.

  1. Rewrite A1+1B=B0A1+1B=B0 using place value.
    10A+1+10+B=10B10A+1+10+B=10B
  2. Rearrange the equation.
    10A+11=9B10A+11=9B
  3. The digit solution gives distinct values and checks in the original sum.
    A=7,B=9,71+19=90A=7,\quad B=9,\quad 71+19=90
Answer: A=7, B=9A=7,\ B=9

Cryptarithm solutions

  • Addition: AB+37=6AAB+37=6A gives 25+37=6225+37=62; ON+ON+ON=POON+ON+ON=PO has solutions 17×3=5117\times3=51, 24×3=7224\times3=72, and 31×3=9331\times3=93; QR+QR+QR=PRRQR+QR+QR=PRR gives 85×3=25585\times3=255.
  • Two-digit products: PQ×8=RSPQ\times8=RS gives 12×8=9612\times8=96; GH×H=9KGH\times H=9K gives 24×4=9624\times4=96.
  • Products with a repeated pattern: UT×3=PUTUT\times3=PUT gives 50×3=15050\times3=150; AB×5=BCAB\times5=BC gives 19×5=9519\times5=95.
  • Further products: L2N×2=2NPL2N\times2=2NP gives 124×2=248124\times2=248 or 125×2=250125\times2=250; XY×4=ZXXY\times4=ZX gives 23×4=9223\times4=92.
  • Repeated letters: PP×QQ=PRPPP\times QQ=PRP gives 22×11=24222\times11=242; JK×6=KKKJK\times6=KKK gives 74×6=44474\times6=444.
  • Three- and four-digit products: EF×E=GGGEF\times E=GGG gives 37×3=11137\times3=111; WOW×5=MEOWWOW\times5=MEOW gives 575×5=2875575\times5=2875.
⚠ Common mistake

Do not change a letter's digit from one column to another: each letter has one fixed digit, and different letters must have different digits.

Divisibility and Number Patterns

Definition

Divisibility test — A quick rule for deciding whether a number is divisible by another number without performing the full division.

Divisibility tests used in this lecture
DivisorTest
22The last digit is even.
33 or 99The digit sum is divisible by 33 or 99, respectively.
44The number formed by the last two digits is divisible by 44.
55The last digit is 00 or 55.
66The number is divisible by both 22 and 33.
1111The alternating sum of the digits is divisible by 1111.
1515The number is divisible by both 33 and 55.
1818The number is divisible by both 22 and 99.
4444The number is divisible by both 44 and 1111.
Digit sums and rearrangements

A number is divisible by 99 exactly when its digit sum is divisible by 99. Reversing or shuffling its digits preserves the digit sum, so the rearranged number is also divisible by 99.

Sum of two multiples of 33

If the numbers are 3a3a and 3b3b, their sum is divisible by 66 exactly when a+ba+b is even—that is, when aa and bb have the same parity.

3a+3b=3(a+b)3a+3b=3(a+b)

Number patterns and classifications

  • Remainders: The two numbers are 12k+812k+8 and 12m−412m-4. Their sum is 12(k+m)+412(k+m)+4, which is divisible by 88 only when k+mk+m is odd; Snehal's claim is not always true.
  • Multiples of 1111: Doubling any multiple of 1111 always gives another multiple of 1111.
  • Consecutive integers: The product of two consecutive integers is always even; it is divisible by 66 only if one of them is a multiple of 33.
  • Consecutive products: The product of four consecutive integers is always divisible by 2424; the product of five consecutive integers is always divisible by 120120.
  • Always true: The product of a multiple of 66 and a multiple of 33 is divisible by 99. The sum of three consecutive even numbers is divisible by 66.
  • Digit rearrangement: If abcdefabcdef is divisible by 66, then badcefbadcef is also divisible by 66: the digit sum is unchanged and the last digit remains ff.
  • Expression test: 8(7b−3)−4(11b+1)=12b−288(7b-3)-4(11b+1)=12b-28, which is never divisible by 1212 for integer bb.
  • Three-number sums: A sum is divisible by 33 exactly when the sum of the three remainders upon division by 33 is divisible by 33.
  • Multiples of 3636: Since 45,00045{,}000 is divisible by 3636, five multiples between 45,00045{,}000 and 47,00047{,}000 are 45,03645{,}036, 45,07245{,}072, 45,10845{,}108, 45,14445{,}144, and 45,18045{,}180.
  • Multiples-set relationship: Every multiple of 3232 is a multiple of 88, and every multiple of 88 is a multiple of 44.
Five consecutive even numbers
5p−4,5p−2,5p,5p+2,5p+45p-4,\quad 5p-2,\quad 5p,\quad 5p+2,\quad 5p+4

If the middle number is 5p5p, the five numbers in order are:

Three consecutive numbers with specified divisors
12k+2,12k+3,12k+412k+2,\quad 12k+3,\quad 12k+4

For the first to be divisible by 22, the second by 33, and the third by 44, all such sequences have this form:

Testing divisibility with digit conditions

  1. Break the divisor into factors with known divisibility tests.
  2. Apply each test separately, such as an even last digit and a digit sum divisible by 99.
  3. List the digit choices that satisfy all conditions, then check each pair.
Worked example

Find all digit pairs (a,b)(a,b) for which 48a23b48a23b is divisible by 1818.

  1. For 48a23b48a23b to be divisible by 1818, it must be even and its digit sum must be divisible by 99.
    b∈{0,2,4,6,8},17+a+b≡0(mod9)b\in\{0,2,4,6,8\},\qquad 17+a+b\equiv0\pmod 9
  2. The possible digit sums give the following values for a+ba+b.
    a+b∈{1,10}a+b\in\{1,10\}
  3. Combine these conditions to list the valid digit pairs.
    (a,b)∈{(1,0),(8,2),(6,4),(4,6),(2,8)}(a,b)\in\{(1,0),(8,2),(6,4),(4,6),(2,8)\}
Answer: (a,b)=(1,0),(8,2),(6,4),(4,6),(2,8)(a,b)=(1,0),(8,2),(6,4),(4,6),(2,8)
Practice

If 31z531z5 is divisible by 99, find all possible digits zz.

Hint: Use the digit-sum test for 99.
Key step: 3+1+z+5=9+z3+1+z+5=9+z must be divisible by 99.
Solution: z=0z=0 or z=9z=9, since both give a digit sum divisible by 99.
Practice

Find all digit pairs (p,q)(p,q) for which 3p7q83p7q8 is divisible by 4444.

Hint: Apply the tests for 44 and 1111.
Key step: The last two digits require even qq; the alternating sum gives 18−p−q18-p-q divisible by 1111.
Solution: Since qq is even and 18−p−q18-p-q must be divisible by 1111, the pairs are (p,q)=(7,0),(5,2),(3,4),(1,6)(p,q)=(7,0),(5,2),(3,4),(1,6).
Practice

Give a six-digit number divisible by 1515 whose reversed digits form a number divisible by 66.

Hint: The original must end in 00 or 55; the reversed number must be even and have digit sum divisible by 33.
Key step: 234510234510 has digit sum 1515 and ends in 00; its reversal is 1543215432.
Solution: 234510234510 is divisible by 1515. Its reversal, 1543215432, is even and has digit sum 1515, so it is divisible by 66.
⚠ Common mistake

For divisibility by a composite number such as 1818, check all required conditions: an even last digit alone is not enough; the number must also be divisible by 99.

What is the relationship between multiples of 44, 88, and 3232?

Answer: Every multiple of 3232 is a multiple of 88, and every multiple of 88 is a multiple of 44. Thus, multiples of 32⊆32\subseteq multiples of 8⊆8\subseteq multiples of 44.

Quick recap

  • A cryptarithm assigns a fixed, distinct digit to each letter; leading digits cannot be zero.
  • Solve cryptarithms with place value, column arithmetic, carries, and digit-length limits.
  • Rearranging digits preserves divisibility by 99 because the digit sum does not change.
  • Divisibility by 1818 requires an even number and a digit sum divisible by 99.
  • The sum of two multiples of 33 is divisible by 66 exactly when their quotients by 33 have the same parity.
  • Use algebraic forms and divisibility tests to check remainder claims and number patterns.
Lecture 8

Summary

Reference video · Lecture 8Summary

Divisibility Properties

Definition

Divisibility — The notation b∣ab\mid a means that aa is divisible by bb; equivalently, a=kba=kb for some integer kk.

Basic divisibility properties

If b∣ab\mid a, then bb divides every multiple of aa, and every factor of bb divides aa. If d∣md\mid m and d∣nd\mid n, then dd divides both their sum and difference. If b∣ab\mid a and c∣ac\mid a, then lcm⁡(b,c)∣a\operatorname{lcm}(b,c)\mid a.

Divisibility rules
b∣a⇒b∣ka,r∣b, b∣a⇒r∣a,d∣m, d∣n⇒d∣(m+n), d∣(m−n),b∣a, c∣a⇒lcm⁡(b,c)∣ab\mid a\Rightarrow b\mid ka,\quad r\mid b,\ b\mid a\Rightarrow r\mid a,\quad d\mid m,\ d\mid n\Rightarrow d\mid(m+n),\ d\mid(m-n),\quad b\mid a,\ c\mid a\Rightarrow\operatorname{lcm}(b,c)\mid a

Here, kk is an integer, and rr is any factor of bb.

Apply divisibility properties

  1. To show a divisor divides a sum or difference, first check that it divides both numbers.
  2. If two numbers both divide a number, find their LCM to identify the largest divisor guaranteed by this property.
  3. For the multiple rule, multiply the given divisible number by an integer.
Worked example

Use divisibility properties to find a common divisor of 20+1220+12 and 20−1220-12, and the LCM of divisors 88 and 1212 of 7272.

  1. Since 44 divides both numbers, it divides their sum and difference.
    4∣20,4∣12⇒4∣(20+12),4∣(20−12)4\mid20,\quad 4\mid12\Rightarrow 4\mid(20+12),\quad 4\mid(20-12)
  2. Evaluate the sum and difference.
    20+12=32,20−12=820+12=32,\quad 20-12=8
  3. Since 88 and 1212 both divide 7272, their LCM also divides 7272.
    lcm⁡(8,12)=24,24∣72\operatorname{lcm}(8,12)=24,\quad 24\mid72
Answer: The common divisor is 44; lcm⁡(8,12)=24\operatorname{lcm}(8,12)=24, and 24∣7224\mid72.

Divisibility Tests for 3, 9 and 11

Quick divisibility tests
DivisorTest
33The sum of the digits is divisible by 33.
99The sum of the digits is divisible by 99.
1111The difference between the sums of alternate digits is divisible by 1111, including when the difference is 00.
Why the digit tests work

Write a number in place-value form. For divisibility by 33 or 99, each power of 1010 leaves remainder 11, so the number has the same remainder as its digit sum. For divisibility by 1111, powers of 1010 alternate between remainders 11 and −1-1, so the number has the same remainder as its alternating digit sum.

10k≡1(mod3),10k≡1(mod9),10k≡(−1)k(mod11)10^k\equiv1\pmod{3},\quad 10^k\equiv1\pmod{9},\quad 10^k\equiv(-1)^k\pmod{11}

Check divisibility using digits

  1. For 33 or 99, add the digits and test whether their sum is divisible by the chosen divisor.
  2. For 1111, alternately add and subtract the digits, then test whether the result is divisible by 1111.
    d1−d2+d3−d4+⋯d_1-d_2+d_3-d_4+\cdots
Worked example

Test whether 5,0825{,}082 is divisible by 33, 99, and 1111.

  1. Add the digits of 5,0825{,}082 to test divisibility by 33 and 99.
    5+0+8+2=155+0+8+2=15
  2. The digit sum is divisible by 33, but not by 99.
    3∣15,9∤153\mid15,\quad 9\nmid15
  3. Find the alternating sum to test divisibility by 1111.
    5−0+8−2=115-0+8-2=11
  4. The alternating sum is divisible by 1111, so the original number is too.
    11∣1111\mid11
Answer: 5,0825{,}082 is divisible by 33 and 1111, but not by 99.
⚠ Common mistake

For 1111, do not simply add all the digits. Alternate addition and subtraction, then check whether the result is a multiple of 1111.

Practice

If 66 divides both 4242 and 3030, what can you conclude about 42+3042+30 and 42−3042-30?

Hint: Use the common divisor property for sums and differences.
Key step: 6∣426\mid42 and 6∣306\mid30, so 66 divides both results.
Solution: 42+30=7242+30=72 and 42−30=1242-30=12; both are divisible by 66.
Practice

Test 7,4257{,}425 for divisibility by 33, 99, and 1111.

Hint: Use the digit sum for 33 and 99, and an alternating sum for 1111.
Key step: The digit sum is 1818; the alternating sum is 7−4+2−5=07-4+2-5=0.
Solution: 7,4257{,}425 is divisible by 33, 99, and 1111.

Quick recap

  • If b∣ab\mid a, every multiple of aa is divisible by bb, and every factor of bb divides aa.
  • A common divisor of two numbers divides their sum and difference.
  • If bb and cc both divide aa, then lcm⁡(b,c)∣a\operatorname{lcm}(b,c)\mid a.
  • For 33 and 99, divisibility is tested by adding the digits.
  • For 1111, divisibility is tested by the alternating sum of the digits.
  • The tests follow from the remainders of powers of 1010 when divided by 33, 99, and 1111.

Formula sheet

Odd number as two consecutive integers
N=N−12+N+12N=\frac{N-1}{2}+\frac{N+1}{2}
Factor test for evenness
E=2k,k∈ZE=2k,\quad k\in\mathbb{Z}
Two forms of even numbers
4por4p+24p\quad\text{or}\quad 4p+2
Sum and difference of multiples
M+N=a(p+q),M−N=a(p−q)M+N=a(p+q),\qquad M-N=a(p-q)
Remainder 3 when divided by 5
N=5k+3 (k≥0),N=5k−2 (k≥1)N=5k+3\ (k\ge0),\qquad N=5k-2\ (k\ge1)
Consecutive-number forms
n,n+1,n+2,n+3p−4,p−3,p−2,p−1,p\begin{aligned}n,n+1,n+2,n+3\\p-4,p-3,p-2,p-1,p\end{aligned}
Place-value tests
N=10q+a,N=100q+r,N=1000q+sN=10q+a,\qquad N=100q+r,\qquad N=1000q+s
Remainder and digit sum
N≡sum of digits of N(mod9)N\equiv \text{sum of digits of }N\pmod 9
Digit-sum rule
N≡d0+d1+⋯+dk(mod3)N \equiv d_0+d_1+\cdots+d_k \pmod{3}
Alternating-sum rule
N≡d0−d1+d2−⋯+(−1)kdk(mod11)N \equiv d_0-d_1+d_2-\cdots+(-1)^k d_k \pmod{11}
Coprime-factor divisibility test
gcd⁡(a,b)=1,ab∣n  ⟺  (a∣n)∧(b∣n)\gcd(a,b)=1,\quad ab\mid n\iff(a\mid n)\land(b\mid n)
Digital root from the remainder modulo 99
dr⁡(n)={0,n=09,n>0 and n≡0(mod9)n mod 9,n≢0(mod9)\operatorname{dr}(n)=\begin{cases}0,&n=0\\9,&n>0\text{ and }n\equiv0\pmod9\\n\bmod9,&n\not\equiv0\pmod9\end{cases}
Change in digital root after adding a fixed amount
(n+k)≡n+(k mod 9)(mod9)(n+k)\equiv n+(k\bmod9)\pmod9
Five consecutive even numbers
5p−4,5p−2,5p,5p+2,5p+45p-4,\quad 5p-2,\quad 5p,\quad 5p+2,\quad 5p+4
Three consecutive numbers with specified divisors
12k+2,12k+3,12k+412k+2,\quad 12k+3,\quad 12k+4
Divisibility rules
b∣a⇒b∣ka,r∣b, b∣a⇒r∣a,d∣m, d∣n⇒d∣(m+n), d∣(m−n),b∣a, c∣a⇒lcm⁡(b,c)∣ab\mid a\Rightarrow b\mid ka,\quad r\mid b,\ b\mid a\Rightarrow r\mid a,\quad d\mid m,\ d\mid n\Rightarrow d\mid(m+n),\ d\mid(m-n),\quad b\mid a,\ c\mid a\Rightarrow\operatorname{lcm}(b,c)\mid a

Mathematics — ALL CHAPTERS

1

A Square And A Cube

View

2

Power Play

View

3

A Story of Numbers

View

4

Quadrilaterals

View

5

Number Play

View

6

We Distribute, Yet Things Multiply

View

7

Proportional Reasoning-1

View

1

Fractions in Disguise

View

2

The Baudhayana-Pythagoras Theorem

View

3

Proportional Reasoning-2

View

4

Exploring Some Geometric Themes

View

5

Tales by Dots and Lines

View

6

Algebra Play

View

7

Area

View