Number Theory, Modular Arithmetic / Remainder Arithmetic, Divisibility Rules

Divisibility rules are shortcuts to determine if an integer is exactly divisible by another smaller integer without performing the full division. Questions involve applying these rules for various divisors (e.g., 2, 3, 4, 5, 9, 10, 11) to test numbers or find missing digits.

• Question

  In the magical land, there are only coins of `5`, `6`, and `15` liras. Shlomi currently only has coins of `6` and `15` liras. Shlomi wants to buy a book that costs `38` liras. Will he be able to pay for the book without change?

  Topics:

  Arithmetic Number Theory -> Modular Arithmetic / Remainder Arithmetic -> Divisibility Rules Number Theory -> Division

• Question

  Consider the integers from `1` to `700`.

  a. How many of these numbers are even?

  b. How many of these numbers are divisible by `7`?

  c. How many of these numbers are not divisible by `2` nor by `7`?

  Answer question c.

  Topics:

  Number Theory -> Prime Numbers Arithmetic Number Theory -> Modular Arithmetic / Remainder Arithmetic -> Divisibility Rules Combinatorics -> Matchings Number Theory -> Division -> Parity (Even/Odd) Number Theory -> Greatest Common Divisor (GCD) and Least Common Multiple (LCM) Set Theory

• Baobab

  In the following exercise, identical digits have been replaced with identical letters, and different digits have been replaced with different letters. Reconstruct the exercise.

  `BAOxxBAxxB = 2002`

   

   

   

   

  Topics:

  Arithmetic Number Theory -> Modular Arithmetic / Remainder Arithmetic -> Divisibility Rules Logic -> Reasoning / Logic Number Theory -> Prime Numbers -> Prime Factorization Combinatorics -> Case Analysis / Checking Cases -> Processes / Procedures Puzzles and Rebuses -> Reconstruct the Exercise / Cryptarithmetic

• Question

  Find all numbers that are divisible by 30 and have exactly 30 distinct divisors (enter the number of such numbers to check your answer)

  Show hint

  Log in here to receive the hint
  Topics:

  Number Theory -> Modular Arithmetic / Remainder Arithmetic -> Divisibility Rules Number Theory -> Prime Numbers -> Prime Factorization
  Sources:
  • Tournament of Towns, 1981-1982, Spring

• Question

  Given the sequence `1 , 1/2 ,1/3 ,1/4 ,1/5,...`, does there exist an arithmetic sequence composed of terms from the aforementioned sequence?

  1. Of length 5

  2. Of any length

  Show hint

  Log in here to receive the hint
  Topics:

  Number Theory -> Modular Arithmetic / Remainder Arithmetic -> Divisibility Rules Proof and Example -> Constructing an Example / Counterexample Algebra -> Sequences -> Arithmetic Progression / Arithmetic Sequence Arithmetic -> Fractions Number Theory -> Greatest Common Divisor (GCD) and Least Common Multiple (LCM)
  Sources:
  • Tournament of Towns, 1981-1982, Spring

• 5 but not 7

  How many numbers from 1 to 100 (inclusive) are divisible by 5 but not divisible by 7?
   

  Show hint

  Log in here to receive the hint
  Topics:

  Arithmetic Number Theory -> Modular Arithmetic / Remainder Arithmetic -> Divisibility Rules Number Theory -> Division
  Sources:
  • Young Mathematician Olympiad, 2017-2018, Stage A, Grades 3-4 Question 6

• Question

  Given natural numbers n, a, b such that `3n+1=a^2` and `4n+1=b^2`, prove that:

  a. n is divisible by 8 (easier)

  b. n is divisible by 56

  Show hint

  Log in here to receive the hint
  Topics:

  Number Theory -> Modular Arithmetic / Remainder Arithmetic -> Divisibility Rules Algebra -> Equations -> Diophantine Equations
  Sources:
  • Mink Exercises and Additional Competition Materials, 2018-2019, Exercise 3 Question 5

• Question

  Given a regular polygon with n vertices. Calculate the number of distinct (non-congruent) triangles whose vertices coincide with the vertices of the polygon.

  Show hint

  Log in here to receive the hint
  Topics:

  Combinatorics Number Theory -> Modular Arithmetic / Remainder Arithmetic -> Divisibility Rules Geometry -> Plane Geometry -> Angle Calculation Geometry -> Plane Geometry -> Triangles -> Triangle Congruence
  Sources:
  • Mink Exercises and Additional Competition Materials, 2018-2019, Exercise 4 Question 3

• What's the Number?

  Find a three-digit number that, when we add 1 to it, is divisible by 7; when we add 2 to it, is divisible by 8; and when we add 3 to it, is divisible by 9.

  Topics:

  Number Theory -> Modular Arithmetic / Remainder Arithmetic -> Divisibility Rules
  Sources:
  • Young Mathematician Olympiad, 2017-2018, Stage A, Grades 5-6 Question 4

• Question

  Consider all the numbers from 1 to 4242. Find the difference between the number of odd numbers divisible by 3
  and the number of numbers divisible by 7 in this range.

  Topics:

  Number Theory -> Modular Arithmetic / Remainder Arithmetic -> Divisibility Rules Arithmetic -> Fractions Number Theory -> Division
  Sources:
  • Young Mathematician Olympiad, 2017-2018, Stage A, Grades 5-6 Question 5