Professional Documents
Culture Documents
Middle School Problems
Middle School Problems
Keywords: Divisors
Problem 2:
Simplify:
⋆ 5xy − 10 + 16xy + 8
1
⋆ xy · [ 18 · (24xy) + 3xy]
x 2 (3x2 y 3 )2
⋆ ( 8y ) · x2 y 3
√ √
3
12 √108
⋆ √3
4
· 3
Problem 3:
Complete by the adequate digit(s) so that:
• the number 311□ is divisible by 5
• the number 1189□4 is divisible by 8
• the number 3□9 is divisible by 9
• the number 89□43 is divisible by 11
• the number 187□□4 is divisible by 72
Keywords: Divisibility
Problem 4:
What is the smallest natural number n whose only digits are 1 and 2 that satisfies:
n being divisible by 44 ?
Keywords: Divisibility
Problem 5:
If a|b, find the value of d and m such that:
⊚ d = gcd(a, b)
⊚ m = lcm(a, b)
Note: saying that a | b means that a divides b
Problem 6:
Mr.Asianius never uses a calculator.
He challenged you to do so in order to figure out if these 2 statements are true:
■ 6|1537774332
■ 4|1537774332
According only to the 2 past results, what is the greatest natural number that must di-
vide: 1537774332 ?
Note: saying that a | b means that a divides b
Keywords: Divisors
Problem 8:
x is a natural number (x ∈ N)
Can we say that if 3|x3 , then necessarily:
• 9 | x3
• 27 | x3
• 81 | x3
Note: Writing a | b means that a divides b
Problem 9:
Mr.Legendrus knows a lot about prime numbers. He gave you a simple definition:
A prime number is a natural number ⩾ 2
whose only factors are 1 and itself.
E.g. 2 and 3 are prime numbers.
Whereas, 6 isn’t, since 6 = 2 · 3 = 1 · 6.
n 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 ...
n2 + n + 41 41 43 47 53 61 71 83 97 113 151 173 197 223 251 281 313 ...
□ What does ”proof by counter example” mean ?
□ Check if the first numbers (when n ∈ {0, 1, · · · , 14, 15}) given by the polynomial
n2 + n + 41 are prime.
□ Do you think that this formula generates prime numbers only ?
Problem 10:
Find the smallest natural number n ⩾ 3 such that its remainder modulo (after dividing
n by) 3, 5, 7 and 11 is a non-zero constant integer.
Problem 11:
m and n are positive integers.
If n was the remainder of the euclidian division of any of the following numbers: 1238, 1596, 2491
by m, then compute the sum m + n.
Problem 12:
Mr.A doesn’t want anyone to know his age.
However, after talking to him, he told you that he’s younger than his fried who is 100
years old, that if you divided his age by 3, 4 and 5 separately, the remainder would be
2, 3 and 4 respectively.
Can you find Mr.A’s age?
Problem 14:
Miss.Germainius once found a trick to factorize a4 + 4b4 = (a2 )2 + (2b2 )2
But she wanted you to discover it by yourself, so she gave you 2 hints:
⊚ (x + y)2 = x2 + y 2 + 2xy
⊚ (x + y)(x − y) = x2 − y 2
Using Miss.Germainius’ trick, prove that 20094 + 42009 isn’t prime.
Problem 15:
How many prime numbers can be formed only by using these digits 2, 5, 7
without repetition ?
Problem 16:
m, n are positive integers.
Find the smallest m such that: 2940m = n2
Problem 17:
x, y, z, w are prime numbers.
x · y · z · w = 2002
Compute x2 + y 2 + z 2 + w2
Problem 18:
This number: 32639 is the product of 2 prime numbers p and q, such that p is almost
half of the other prime q.
Problem 19:
One can see that: (a + b)3 = a3 + 3ab(a + b)
This implies that a3 +b3 = (a+b)3 −3ab(a+b) = (a+b)[(a+b)2 −3ab] = (a+b)(a2 −ab+b2 )
Using this remarquable identity, prove that 27000001 is the product of 4 distinct prime
numbers.
Problem 20: 2
+q 2
p, q are prime numbers; r = pp+q .
Using that gcd(a, b) = gcd(a, b − an) and proof by contradiction by supposing (p ̸= q)
Prove that r is a prime number.
18th
q problem solution:
⌊ 32639
2 ⌋ = 127 which is prime.
We can suppose that p = 127.
The number 32639 ≡ 9 (mod 10) implying that q ≡ 7 (mod 10)
127 · 2 + 3 = 257 which is prime.
We can easily check that: 127 · 257 = 32639