IOQM · Mathematics · Number Theory
Divisibility rules, GCD, LCM, Euclidean algorithm and Bezout's identity.
Test yourself on Divisibility
5 real IOQM questions with instant answers — no signup, ~3 minutes.
Study notes are still being prepared.
Don't wait — Shishya can teach you this topic right now, on demand.
Ask Shishya to teach this →Shishya is your personal tutor for this topic. Pick a starter or open a free chat.
Q1 · Divisibility · EASY
Find the number of positive integers n less than 100 such that n divides 2n² + 7n + 3.
Q2 · Divisibility · EASY
Let N be the number of positive integers less than 100 that are divisible by exactly two of 2, 3, and 5. Find N.