Scribd
Upload
3 views1 page

Number Pattern, Arithmetic

The document presents a series of mathematical problems and their solutions. It includes finding the largest two-digit number from five consecutive numbers with specific divisibility conditions, identifying a number with a digit sum of 35, and determining a whole number based on a given equation. Additionally, it calculates the 123rd number in a sequence after removing multiples of 5 or 7.

Uploaded by

hanzahfariste
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views1 page

Number Pattern, Arithmetic

The document presents a series of mathematical problems and their solutions. It includes finding the largest two-digit number from five consecutive numbers with specific divisibility conditions, identifying a number with a digit sum of 35, and determining a whole number based on a given equation. Additionally, it calculates the 123rd number in a sequence after removing multiples of 5 or 7.

Uploaded by

hanzahfariste
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Dinh Phuc Minh

19. There are five consecutive two digit numbers. Three of these numbers have a sum that is divisible by
37 . Three of these numbers have a sum that is divisible by 60 . Find the largest two digit number.

20. Find the smallest positive whole number whose sum of digits is equal to 35 , last two digits is 35 and is
divisible by 35 .

21. Let N be a whole number abc.


Given that N = abc = ac + ba + ca + ab + cb + bc, find the largest possible value of N.

22. There is a sequence of the first 300 positive integers 1,2,3,...,299,300. If the numbers
that are divisible by 5 or 7 are removed from the sequence, find the 123rd number in the
remaining sequence.

19, 5 numbers = x-2,x-1,x,x+1,x+2


x+2 <= 99 -> x <= 97
x-2 >= 10 -> x >= 12
44 iterations of bruteforcing later...
x = 45,
43,44,45,46,47
3 of those sum is divisible by 37 and 60
-> Ans: 47

20.
n = number
sum of digits = 35
last two = 35
n divisible by 35
Guess and checking, Ans: n = 99935

21. N = abc = 100a + 10b + c = 10a + c + 10b + a + 10c + a + 10a + b + 10c + b + 10b + c
= 2(ab + bc + ca)
Trying a = 3, 300 + 10b + c = 2(30+b + bc + 10c+3)
Trying b=9, 390 + c = 2(39 + 90 + c + 10c + 3)
-> c = 6
-> Ans: 396

22.
We have the sequence from 1 to 300, after banishing the numbers that are divisible by 5 or 7, we
have: 1,2,3,...,299. The 123rd element of the array is 179.
Ans: 179

You might also like