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.
Divisibility Rules by 2, 4, and 8 Divisibility Rules by 3 and 9 Divisibility Rule by 11 Divisibility Rules by 5 and 25-
Question
Let `n` be a natural number. Prove that if the sum of the digits of `5n` is equal to the sum of the digits of `n`, then `n` is divisible by `9`.
-
Palindromic Number
Find a four-digit palindromic number that is divisible by 25 and not divisible by 3.
Note: A palindromic number is a number that does not change if its digits are read in reverse order. For example, the number 5775 is a palindromic number, and the number 5778 is not a palindromic number.
Sources:Topics:Number Theory -> Modular Arithmetic / Remainder Arithmetic -> Divisibility Rules -> Divisibility Rules by 3 and 9 Number Theory -> Division -> Parity (Even/Odd) Number Theory -> Modular Arithmetic / Remainder Arithmetic -> Divisibility Rules -> Divisibility Rules by 5 and 25 Combinatorics -> Case Analysis / Checking Cases -> Processes / Procedures -
50 to the Power of
Show that in the rightmost 504 digits of `1+50+50^2+...+50^1000`
Each digit appears a number of times divisible by 12
Sources: -
Divisible by 2 or 5 but not 3
How many five-digit numbers are divisible by 2 or 5, but not divisible by 3?
Sources: -
6 on the Board
The number 6 is written on the board. At each step, you can add the digit 6 to the end of the number (so that it is the units digit,) or replace the number with the sum of its digits.
Which numbers can be obtained in this way? Describe the entire set of numbers and explain why there are no moreSources:Topics:Arithmetic Number Theory -> Modular Arithmetic / Remainder Arithmetic -> Divisibility Rules -> Divisibility Rules by 3 and 9 Combinatorics -> Induction (Mathematical Induction) Logic -> Reasoning / Logic Number Theory -> Division -> Parity (Even/Odd) Algebra -> Sequences Combinatorics -> Case Analysis / Checking Cases -> Processes / Procedures -
Cards with Digits
Rachel has three cards with different digits, all of which are greater than 0. Rachel formed all possible three-digit numbers from these cards and calculated their sum.
Sources:
Prove that the sum is divisible by 3 -
Question
The numbers from 1 to `10^9` (inclusive) are written on the board. The numbers divisible by 3 are written in red, and the rest of the numbers are written in blue. The sum of all the red numbers is equal to `X`, and the sum of all the blue numbers is equal to `Y`. Which number is larger, `2X` or `Y`, and by how much?
Sources:Topics:Arithmetic Number Theory -> Modular Arithmetic / Remainder Arithmetic -> Divisibility Rules -> Divisibility Rules by 3 and 9 Logic -> Reasoning / Logic Algebra -> Sequences Algebra -> Inequalities -> Averages / Means Number Theory -> Division- Beno Arbel Olympiad, 2017, Grade 8 Question 2
-
THE BARREL OF BEER
A man bought an odd lot of wine in barrels and one barrel containing beer. These are shown in the illustration, marked with the number of gallons that each barrel contained. He sold a quantity of the wine to one man and twice the quantity to another, but kept the beer to himself. The puzzle is to point out which barrel contains beer. Can you say which one it is? Of course, the man sold the barrels just as he bought them, without manipulating in any way the contents.
Sources:Topics:Arithmetic Number Theory -> Modular Arithmetic / Remainder Arithmetic -> Divisibility Rules -> Divisibility Rules by 3 and 9 Algebra -> Word Problems Logic -> Reasoning / Logic- Amusements in Mathematics, Henry Ernest Dudeney Question 76
-
DIGITAL DIVISION
It is another good puzzle so to arrange the nine digits (the nought excluded) into two groups so that one group when divided by the other produces a given number without remainder. For example, `1` `3` `4` `5` `8` divided by `6` `7` `2` `9` gives `2`. Can the reader find similar arrangements producing `3, 4, 5, 6, 7, 8`, and `9` respectively? Also, can he find the pairs of smallest possible numbers in each case? Thus, `1` `4` `6` `5` `8` divided by `7` `3` `2` `9` is just as correct for `2` as the other example we have given, but the numbers are higher.Sources:Topics:Arithmetic Number Theory -> Modular Arithmetic / Remainder Arithmetic -> Divisibility Rules -> Divisibility Rules by 3 and 9 Number Theory -> Division- Amusements in Mathematics, Henry Ernest Dudeney Question 88
-
SLV LVS BLS
In the following expression, different letters represent different digits, and identical letters represent identical digits:
SLV = LVS + BLS
Find the number SLV.
Sources: