Boy, it sure was cold in Times Square this morning.
Mark:
8 QUESTIONS
Score = 7
Question#, Answer, Points
1. C 1
2. A 1
3. D 1
4. C 1
5. D 1
6. D 1
7. B 1
8. A 0
Logic Test --- Solution CADCDDBA
The unique highest possible score is 7, and it can only be obtained by answering the last question wrong! Three cheers for Mark.
MULTIPLICATION BY 99
If the problem were restated as:
"To multiply any number x by 99, all we do is move the decimal point of x two positions to the right, and then subtract x."
"It would be true."
True, very true.
"Thanks for the proof. It's rather simple."
When you know the answer, the question is always simple.
X:
"Hmm
" :wink:
You are soooo polite. Mark has re-worded the question to match my answer.
"The highest possible score on the test is 7, but that can only be achieved by getting question (8) wrong The solution is unique: C-A-D-C-D-D-B-A"
Three further cheers for X.
I see you are a wizard in waiting.
"10. It's all modulo 3 in binary. 100 is 4, which is congruent to 1 mod 3. Half of 10, or 2, is also 1. In the end, the answer isn't changed by the fact that it's mod 3."
Fairynuff, you win. I would never have got to that answer. My only comfort is no one else did either.
Fairy Nuff asks:
What is the smallest number with every digit = 1 or 0 that is divisible by 225
The numbers 1 up to and including 8 must be put in the circles of the depicted net. However, numbers in neighbouring circles must differ more than 1.
For example, circles connected to a circle with a 4 may not contain a 3 or a 5.
Can you meet the challenge
* 0 0 *
0 0 0 0
* 0 0 *
It's always 1 to 6,
it's always 15 to 20,
it's always 5,
but it's never 21,
unless it's flying.
What am I