Insurance Job Advertisements

Actuarial

Friday, 18 September 2009

Brain Teaser #1

For the brainy people out there, try this question, adopted straight from primary school mathematics competition:

"Find 8 prime numbers so that their sum is 100. What is the total of the smallest and the largest of these 8 numbers?"

The participants actually had 30 questions to answer in 20 minutes, so on average you have less than 1 minute to answer a question. But for this one, I give you as much time as you like. Post you answer in the Comment section below by showing the 8 numbers as well. See who gets the right answer first.

If you are convinced that there is no solution, please explain.

Labels:

posted by Teh Loo Hai @ 11:00 AM   6 Comments Links to this post

6 Comments:

At 19 September 2009 10:21 AM , Anonymous Anonymous said...

5
5
7
11
13
17
19
23

ans:28

 
At 19 September 2009 12:31 PM , Blogger Teh Loo Hai said...

If repeats are allowed, is this the only possible solution?

If repeats are not allowed, what would be the solution?

 
At 19 September 2009 5:36 PM , Anonymous Anonymous said...

3
7
7
11
13
17
19
23

 
At 7 October 2009 5:10 PM , Anonymous Anonymous said...

1
3
5
7
11
13
17
43
The last 2 could vary (19,41) (23,37) (29,31).
So the total of smallest and largest can be 44, 42, 38 or 32?

 
At 7 October 2009 5:24 PM , Blogger Teh Loo Hai said...

Don't think 1 is a prime number though

 
At 9 October 2009 7:33 AM , Blogger Priyank said...

There is no possible solution unless repeats are allowed. The reason is :
The only possible solution is
2,3,5
11 19
7 13
23 37

From this it can be observed that to get a multiple of 10 (i.e. 100) the only possible combination after 2,3,5 is numbers ending with 1 & 9 or 3 & 7
Even if all the smallest numbers are taken (to meet the second condition of 8 prime numbers) the closest sum you can get is 90.
Which means you are dependent on 2,3 &5 to reach the final sum.

Let me know if there is a better explanation.

 

Post a Comment

Links to this post:

Create a Link

<< Home