John has some chickens that have been laying him plenty of eggs. He wants to give away his eggs to several of his friends, but he wants to give them all the same number of eggs. He figures out that he needs to give 7 of his friends eggs for them to get the same amount, otherwise there is 1 extra egg left.
What is the least number of eggs he needs for this to be true?
Answer: 301 eggs. The number of eggs must be one more than a number that is divisible by 2, 3, 4, 5, and 6 since each of these numbers leave a remainder of 1. For this to be true one less than the number must be divisible by 5, 4, and 3 (6 is 2*3 and 2 is a factor of 4 so they will automatically be a factor). 5 * 4 * 3 = 60. Then you just must find a multiple of 60 such that 60 * n + 1 is divisible by 7. 61 / 7, 121 / 7, 181 / 7, 241 / 7 all leave remainders but 301 / 7 doesn't.
Question: A town builds a bridge, but this bridge can only hold three people at a time or it will collapse. One night, a baker, a flourist and a butcher go on the bridge, and it collapses. Why did it collapse?
Answer: One night , as in a knight , goes on the bridge with the other three people, therefore four people go on the bridge making it collapse.