HelpContactFor teachers and institutes
>_StemPy Lab
Mock TestsClasses

>_StemPy Lab

Learn. Solve. Code the solutions. Test yourself.

Live examsFree mock exams, timed and rankedEveryone starts together, and your score and rank come the moment it ends.See the exams →
Live examsInternational live exams are comingTell us which exam you want first. Timed practice papers are open now.See what is coming →

Learn

  • Physics
  • Chemistry
  • Mathematics
  • Biology
  • Python Programming
  • Statistics & Data Science
  • Computer Science
  • Space Science and Astronomy
  • Earth and Environmental Science
  • Classes
  • Groups

Practice

  • Problems
  • Quizzes
  • Mock Tests
  • Prepare for an Exam
  • Question Sets
  • Exams
  • Certificates
  • Python Labs
  • AI Practice Generator
  • Student-Created Tests

Community

  • Discussions
  • Resources
  • Notes
  • Glossary
  • Blog

Account

  • Log in
© 2026 senLearn. All rights reserved.HelpFor SchoolsAboutContactPrivacy PolicyTerms of UseRefund Policy
  1. Notes
  2. /Division, Divisibility Rules and Primes: Quick Revision
Mathematics

Division, Divisibility Rules and Primes: Quick Revision

A brief note on division with remainders, the divisibility rules, primes and the fundamental theorem of arithmetic. It lists the usual slips and gives questions to check yourself.

StemPy LabWritten by StemPy Lab
Log in to save

A brief note on Division, Divisibility Rules and Primes. Try each question before you open its answer.

The key facts

  • Division algorithm: for b>0b > 0b>0, a=bq+ra = bq + ra=bq+r with 0≤r<b0 \le r < b0≤r<b, in exactly one way.
  • Divisibility: b∣ab \mid ab∣a means a=bka = bka=bk. If d∣ad \mid ad∣a and d∣bd \mid bd∣b, then d∣ax+byd \mid ax + byd∣ax+by.
  • Cases: every integer is 3k3k3k, 3k+13k + 13k+1 or 3k+23k + 23k+2. A square leaves 000 or 111 on division by 333 and by 444.
  • Consecutive integers: the product of kkk of them is divisible by k!k!k!.
  • Factorisations: a−b∣an−bna - b \mid a^n - b^na−b∣an−bn; for odd nnn, a+b∣an+bna + b \mid a^n + b^na+b∣an+bn.
  • Digit rules: digit sum for 333 and 999, alternating sum for 111111, last kkk digits for 2k2^k2k and 5k5^k5k, groups of three for 777, 111111, 131313.
  • Primes: a composite nnn has a prime factor at most n\sqrt{n}n​; there are infinitely many primes.
  • Euclid's lemma: if p∣abp \mid abp∣ab, then p∣ap \mid ap∣a or p∣bp \mid bp∣b.
  • Fundamental theorem: n=p1a1⋯pkakn = p_1^{a_1} \cdots p_k^{a_k}n=p1a1​​⋯pkak​​ in one way only. A kkkth power has every exponent a multiple of kkk.

Practise with new numbers

A program to try

The program tests four facts of this note on many numbers.

Read it first. Then run it. Does each line print what the note says?

1. Change n = 5831 to a number of your own. Do the two remainders still agree?

Mistakes to avoid

  • A negative remainder. The remainder is always between 000 and b−1b - 1b−1.
  • Joining divisors that share a factor. 4∣a4 \mid a4∣a and 6∣a6 \mid a6∣a give only 12∣a12 \mid a12∣a.
  • Splitting a composite divisor of a product. Only a prime can be split by Euclid's lemma.
  • Calling 1 a prime.
  • A pattern is not a proof. Check every case, or give an argument.

Check yourself

  1. Find the remainder of −38-38−38 on division by 666.
  1. Show that n2+nn^2 + nn2+n is even for every integer nnn.
  1. Is 7×11×13×2+17 \times 11 \times 13 \times 2 + 17×11×13×2+1 divisible by 777?
  1. Find the digit ddd for which 38d2‾\overline{38d2}38d2 is divisible by 111111.
  1. Write 26−12^6 - 126−1 as a product of primes.

Sources

  • David M. Burton, Elementary Number Theory, Chapters 2 and 3.
  • NCERT, Mathematics Textbook for Class X, Chapter 1 (Real Numbers).
← All Notes
← Induction in Algebra, Calculus and Olympiad Problems: Quick RevisionCommon Factors, the Euclidean Algorithm and Divisors: Quick Revision →
More onNumber Theory

Discussion (0)

Log in to join the discussion.

Loading…

On this page

  1. The key facts
  2. Practise with new numbers
  3. A program to try
  4. Mistakes to avoid
  5. Check yourself
  6. Sources

Goes with the lesson

  1. Primes and the fundamental theoremDivision, Divisibility Rules and Primes

More notes on this topic

  1. Diophantine Equations and Pythagorean Triples: Quick Revision
  • Fermat, Euler and Wilson: Quick Revision
  • Congruences and the Chinese Remainder Theorem: Quick Revision
  • Factorials, Irrational Numbers, Digits and the Floor Function: Quick Revision
  • Common Factors, the Euclidean Algorithm and Divisors: Quick Revision
  • All notes on this topic →