Find All Possible Values - a Problem of Divisors | Number Theory | Viewer Suggested Problem

preview_player
Показать описание
This is a nice number theory problem sent in by a viewer.

b, c and d are the three smallest positive divisors of n, not equal to 1.
Also, n =  b⁴ + c³ + d² + 9.
Can you find all possible values of n?

Did you solve it?
Let me know in the comments how you solved this problem. I’d love to hear about it!

Test your friends and family to see if they're as quick as you.
Challenge yourself to fun and interesting maths problems and start your journey as an olympiad.
Maths videos by Giuliano Grasso - mathematics graduate from the University of East Anglia.

I post weekly maths olympiad videos for you to try and solve.

If you want to see more problems or send me your own, then subscribe here:
Рекомендации по теме
Комментарии
Автор

Just want to add, at 0:18 I should have made it clearer that b must also be odd.

And at 1:07, d^2 is just 1 mod 4.

GGMaths
Автор

nice i like this problem because it involves divisors, never seen in this channel.

timetraveller
Автор

I remember that on a turkish contest "Antalya Math Olympiad" this problem was featured either 2017 or 2018. Nice solution btw !

asmocak
Автор

Do you have any video for mod equations??
Anyway, it's

samihaafsaraibnat
Автор

Yay ! The reason why I like problems involving divisors is because they use more common sense than Number Theory 😁
And your solution was very ingenious ! I liked it ! And once again thanks for mentioning me in the video, lol 😂

srijanbhowmick
Автор

Let n be a positive integer. Show that any number greater than n⁴/16 can be written in at most one way as the product of two of its divisors having difference not exceeding n.

(1998 St. Petersburg City Mathematical Olympiad)

Please solve this one on your channel .
Thanks.

TechToppers
Автор

2:29 "...plus 2p all squared..." but you write 8p^2. This doesn't affect the result, but it is a weird typo.

themathhatter