20030905, 01:49  #1 
Aug 2003
Snicker, AL
7·137 Posts 
Can you find the smallest number?
This one is really simple. It should take no more than 10 minutes to solve. Your I.Q. can be indirectly extapolated by how long it takes you to figure out this simple mathematical puzzle. ( yeah, if you really believe this, let me sell you a lot I own with ocean frontage :) )
3o minutes or more = I.Q. 100 20 to 30 minutes = I.Q. 120 10 to 20 minutes = I.Q. 140 < 10 minutes = I.Q. 150+ Find the two smallest whole numbers that: divided by seven has a remainder of 4 divided by eight has a remainder of 5 divided by nine has a remainder of 6 Use any tools, programs, etc of your choice to solve. Fusion 
20030905, 02:01  #2  
Jun 2003
The Texas Hill Country
2101_{8} Posts 
Re: Can you find the smallest number?
Quote:
And they even wrote a song about such property in Arizona.... But South Dakota ????? :( As for the puzzle, do you really mean smallest nonnegative integers? If so, it took much longer to type this than it took to find such numbers. 

20030905, 04:07  #3 
Feb 2003
2·5 Posts 
501 and 1005?

20030905, 04:15  #4 
Jun 2003
Shanghai, China
109 Posts 
Why did I feel compelled to use a spreadsheet to do this one? Must be all those years as an accountant

20030905, 04:20  #5 
Aug 2003
Upstate NY, USA
2·163 Posts 
Re: Can you find the smallest number?
Those IQ's are unrealistic....try these
30 minutes or more = I.Q. 70 20 to 30 minutes = I.Q. 80 15 to 20 minutes = I.Q. 90 10 to 15 minutes = I.Q. 100 7 to 10 minutes = I.Q. 110 4 to 7 minutes = I.Q. 120 1 to 4 minutes = I.Q. 130 < 1 minute = I.Q. 140+ Find the two smallest whole numbers that: divided by seven has a remainder of 4 divided by eight has a remainder of 5 divided by nine has a remainder of 6 Use any tools, programs, etc of your choice to solve. 
20031031, 12:20  #6 
Oct 2003
3 Posts 
EASY!
That was so easy  501 and 1005
Found using: <script> var x=0 var y=0 var curnum=1 while(!y && curnum<2000) { if (curnum%7==4 && curnum%8==5 && curnum%9==6) { if (!x) x=curnum else y=curnum } curnum++ } alert("FOUND: "+x+","+y) </SCRIPT> Written and exectued in under a minute! :) 
20031031, 13:38  #7 
May 2003
Belgium
426_{8} Posts 
easy:
just do (7*8*9)9+6 to get the first number. 7*8*9*2 9+6 for the second.... just used windows calculator, less then 30 secs....(with check) [EDIT you can use the 7*8*9 trick, because the greatest common divider is 1...] Last fiddled with by sonjohan on 20031031 at 13:39 
20031031, 14:41  #8 
Cranksta Rap Ayatollah
Jul 2003
1201_{8} Posts 
isn't this just a chinese remainder theorem problem?

20031118, 19:36  #9 
Aug 2002
3·83 Posts 
It would be harder if 7, 8 and 9 weren't all relatively prime.

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Given sigma(n)n, find the smallest possible n  mart_r  Aliquot Sequences  6  20130723 20:50 
Could a Distributed Computing approach help find the smallest Brier number?  jasong  Math  5  20070529 13:30 
smallest number used in a mathematical proof?  ixfd64  Lounge  22  20060201 17:06 
how do you find number of digits of a 2^n number?  Unregistered  Math  11  20041130 22:53 
Smallest untested number?  wirthi  Math  10  20031005 13:02 