You are viewing a single comment's thread from:
RE: Brainsteem Mathematics Challenges - Brilliant Numbers
I gave it a try I don't know how to code well to I did it by hand:
First I made a list of the numbers that include all the prime with one decimal point. then with two decimal points which I split up as follows
1)2,3,5,7
2)11,13,17
3)23
4)31, 37
5)41,43,47
I got it by trail and error I got 1147 (31x37)and 2209(47x47). I'm not sure if using 47 twice is possible. Now I want know if its right haha
The two primes can be any 2-digit primes, eg 47x23.
Is the trial and error the only way to solve this or can we use some other technique? I googled brilliant numbers and they had mods. I have little experience with mods though
A lot of these maths competition questions are about reducing the number of options so that enumeration (trial-and-error) can be done quickly.
I will do some modular arithmetic questions soon, but in this case the numbers are quite small.
The way I would start it is to let the two required numbers by pq and xy and rewrite them as
10p + q and 10x + y , so that the digits have become integers. Now multiply them
(10p + q)(10x + y) = ....
If we look for the smallest first, let this equal 1001 and see if we can find pq and xy, if not move on to 1003 and so on. It is actually fairly quick at this point :-)