Brain Teaser No 1
Posted by: Don Atkinson on 16 November 2001
THE EXPLORER
An explorer set off on a journey. He walked a mile south, a mile east and a mile north. At this point he was back at his start. Where on earth was his starting point? OK, other than the North Pole, which is pretty obvious, where else could he have started this journey?
Cheers
Don
Posted on: 01 March 2004 by Don Atkinson
So, we're all agreed, eleven and a half it is....
Well done.
Now back to Jerremy's infuriating puz.....
Cheers
Don
Well done.
Now back to Jerremy's infuriating puz.....
Cheers
Don
Posted on: 01 March 2004 by Dan M
Following on...
I imagine the maximum area of a triangle that lies within your rectangle is 17.5. However, the proof that area of a triangle that is enclosed within a rectangle of dimension (x,y) is at most x*y/2 does not appear 'trivial.' Anyone care to give it a try?
cheers,
Dan
p.s. This is equivalent to proving that the area of the 3 other triangles must be greater than or equal to x*y/2 (use of the triangle inequality??)
I imagine the maximum area of a triangle that lies within your rectangle is 17.5. However, the proof that area of a triangle that is enclosed within a rectangle of dimension (x,y) is at most x*y/2 does not appear 'trivial.' Anyone care to give it a try?
cheers,
Dan
p.s. This is equivalent to proving that the area of the 3 other triangles must be greater than or equal to x*y/2 (use of the triangle inequality??)
Posted on: 12 March 2004 by JeremyD
Hi Dan,
Since my previous answer disappeared in The Great Forum Mishap of 2004, here's another one. This one's a little neater (I was having a bad brain day last time):
Labels:
P, Q, R: the edges of the triangle.
p, q, r: the vertices of the triangle opposite edges P, Q and R respectively
As before,if any triangle has a vertex (p, say) that's not on the rectangle then a larger triangle can be made by translating vertex p away from edge P along a line perpendicular to P until it reaches the rectangle. [Then the distance moved by p is the increase in height of the triangle].
Therefore, all triangles of maximum size must have all three vertices on the rectangle.
Suppose that the a triangle has all three vertices on the rectangle, and none of the triangle's edges is parallel to an edge of the rectangle.
Then, we can translate p along a line parallel to P until p is within the rectangle. As seen above, this cannot be the largest triangle. But the distance between p and P remains unchanged by the translation, so the area remains the same. Hence the original triangle cannot have been the largest possible.
Therefore, a triangle of maximum size must have at least one edge parallel to an edge of the rectangle.
Suppose a triangle has all three vertices on the rectangle, and edge P of the triangle is parallel to edges S and T of the rectangle. If P is not on S or T then a larger triangle can be made by translating P away from p until it is on S or T. [Then the distance moved by P is the increase in height of the triangle].
Therefore, a triangle of maximum size must have one edge on an edge of the rectangle.
Suppose a triangle has all three vertices on the rectangle, and edge P of the triangle is on edge S of the rectangle. If the vertices q and r of P don't coincide with the edges of S then they can be translated away from each other until they do, to make a larger triangle. [Then the distance moved by q and r is the increase in base of the triangle].
Therefore a triangle of maximum size has all three vertices on the rectangle, with at least one edge of the triangle coinciding exactly with one edge of the rectangle.
So if q and r are the vertices on the coincident edge, P, then vertex p must be on the parallel edge of the rectangle. Wherever p is on that edge, its distance from P is the same. Hence the base and height of the maximum sized triangle must be x and y or y and x respectively, so its area is x*y/2.
There must be an easier way...
Since my previous answer disappeared in The Great Forum Mishap of 2004, here's another one. This one's a little neater (I was having a bad brain day last time):
Labels:
P, Q, R: the edges of the triangle.
p, q, r: the vertices of the triangle opposite edges P, Q and R respectively
As before,if any triangle has a vertex (p, say) that's not on the rectangle then a larger triangle can be made by translating vertex p away from edge P along a line perpendicular to P until it reaches the rectangle. [Then the distance moved by p is the increase in height of the triangle].
Therefore, all triangles of maximum size must have all three vertices on the rectangle.
Suppose that the a triangle has all three vertices on the rectangle, and none of the triangle's edges is parallel to an edge of the rectangle.
Then, we can translate p along a line parallel to P until p is within the rectangle. As seen above, this cannot be the largest triangle. But the distance between p and P remains unchanged by the translation, so the area remains the same. Hence the original triangle cannot have been the largest possible.
Therefore, a triangle of maximum size must have at least one edge parallel to an edge of the rectangle.
Suppose a triangle has all three vertices on the rectangle, and edge P of the triangle is parallel to edges S and T of the rectangle. If P is not on S or T then a larger triangle can be made by translating P away from p until it is on S or T. [Then the distance moved by P is the increase in height of the triangle].
Therefore, a triangle of maximum size must have one edge on an edge of the rectangle.
Suppose a triangle has all three vertices on the rectangle, and edge P of the triangle is on edge S of the rectangle. If the vertices q and r of P don't coincide with the edges of S then they can be translated away from each other until they do, to make a larger triangle. [Then the distance moved by q and r is the increase in base of the triangle].
Therefore a triangle of maximum size has all three vertices on the rectangle, with at least one edge of the triangle coinciding exactly with one edge of the rectangle.
So if q and r are the vertices on the coincident edge, P, then vertex p must be on the parallel edge of the rectangle. Wherever p is on that edge, its distance from P is the same. Hence the base and height of the maximum sized triangle must be x and y or y and x respectively, so its area is x*y/2.
There must be an easier way...

Posted on: 13 March 2004 by Don Atkinson
There must be an easier way
not necessarily...
Cheers
Don
not necessarily...
Cheers
Don
Posted on: 13 March 2004 by Don Atkinson
.... possibly an infuriating puzzle....
Take any whole, positive number less than 51.
If it is even, divide it by 2
If it is odd, multiply it by 3 and add 1
Repeat this for each successive number generated, until you are left with 1
For example, start with 11
11 > 34 > 17 > 52 > 26 > 13 > 40 > 20 > 10 > 5 > 16 > 8 > 4 > 2 > 1
As you can see, it takes 14 steps to reduce the original number to 1
Of the numbers less than 51, which takes the most steps to get to 1?
Cheers
Don
PS. This is one that got lost in the big malfunction....nuf said....
Take any whole, positive number less than 51.
If it is even, divide it by 2
If it is odd, multiply it by 3 and add 1
Repeat this for each successive number generated, until you are left with 1
For example, start with 11
11 > 34 > 17 > 52 > 26 > 13 > 40 > 20 > 10 > 5 > 16 > 8 > 4 > 2 > 1
As you can see, it takes 14 steps to reduce the original number to 1
Of the numbers less than 51, which takes the most steps to get to 1?
Cheers
Don
PS. This is one that got lost in the big malfunction....nuf said....
Posted on: 13 March 2004 by JeremyD
My guess is that it's 47 because it's the highest prime - it just sounds like the sort of thing that ought to be right.
[I probably ought to have some idea of how to do this "properly" by now, as one of the four OU courses I'm supposedly doing this year includes number theory. My courses started over a month ago but I didn't - why am I so stupid? On second thoughts, don't answer that...]
[I probably ought to have some idea of how to do this "properly" by now, as one of the four OU courses I'm supposedly doing this year includes number theory. My courses started over a month ago but I didn't - why am I so stupid? On second thoughts, don't answer that...]
Posted on: 13 March 2004 by Don Atkinson
Two Sheets
Two identical sheets of paper are lying on top of each other, as shown in the diagram.
Which of the two parts of the sheet of paper that is lying underneath is the larger, the part that is covered, or the part that is uncovered?
Cheers
Don
Two identical sheets of paper are lying on top of each other, as shown in the diagram.
Which of the two parts of the sheet of paper that is lying underneath is the larger, the part that is covered, or the part that is uncovered?
Cheers
Don
Posted on: 13 March 2004 by Don Atkinson
Jerramy
I probably ought to have some idea of how to do this "properly" by now
If its any comfort, the great Hungarian mathematician Paul Erdos said of this puzzle "Mathematics isn't ready for this sort of problem"
Cheers
Don
PS I'm afraid 47 isn't right, but you could say it's half right....
I probably ought to have some idea of how to do this "properly" by now
If its any comfort, the great Hungarian mathematician Paul Erdos said of this puzzle "Mathematics isn't ready for this sort of problem"
Cheers
Don
PS I'm afraid 47 isn't right, but you could say it's half right....
Posted on: 13 March 2004 by Paul Ranson
quote:
Of the numbers less than 51, which takes the most steps to get to 1?
I know the answer, this one was very susceptible to brute force. In fact I think I've looked out as far as 10000000. So far all numbers end up at one. Is this a good general assumption? Or a bug...
If you hit a power of 2, you are going direct to 1. All routes to 1 must go via a power of 2. This is completely unhelpful.
Paul
Posted on: 13 March 2004 by Dan M
_Two Sheets_
...the part that is covered
...the part that is covered
Posted on: 13 March 2004 by JeremyD
Don,
re two sheets: the covered part contains a smaller area, a triangle whose area is half the area of the paper. [i.e. the triangle whose vertices are at the point where red's vertex meets blue's edge and the two points where blue's vertices meet red's edges]. So the covered area is greater.
re two sheets: the covered part contains a smaller area, a triangle whose area is half the area of the paper. [i.e. the triangle whose vertices are at the point where red's vertex meets blue's edge and the two points where blue's vertices meet red's edges]. So the covered area is greater.
Posted on: 13 March 2004 by Don Atkinson
Paul
I've looked out as far as 10000000. So far all numbers end up at one. Is this a good general assumption
So far as I know, nobody has ever found a number that doesn't end up as one. OTOH, so far as I know, nobody has yet been able to prove that this will always be the case....
....Ah, Andrew Wi......how nice to meet you....geeting a little bored with Fermat?
Cheers
Don
I've looked out as far as 10000000. So far all numbers end up at one. Is this a good general assumption
So far as I know, nobody has ever found a number that doesn't end up as one. OTOH, so far as I know, nobody has yet been able to prove that this will always be the case....
....Ah, Andrew Wi......how nice to meet you....geeting a little bored with Fermat?
Cheers
Don
Posted on: 13 March 2004 by Don Atkinson
Two sheets answer
There are a few ways to demonstrate that the covered part is bigger...
In my diagram A and A' are eqaul as are B abd B' which means that the covered part is bigger than the uncovered part by C
Cheers
Don
There are a few ways to demonstrate that the covered part is bigger...
In my diagram A and A' are eqaul as are B abd B' which means that the covered part is bigger than the uncovered part by C
Cheers
Don
Posted on: 14 March 2004 by Dan M
JeremyD,
Sorry not to have commented on your answer - when I get a little time I'm going to go through it. Currently I'm playing with my new camera too much.
Dan
Sorry not to have commented on your answer - when I get a little time I'm going to go through it. Currently I'm playing with my new camera too much.
Dan
Posted on: 14 March 2004 by Don Atkinson
Jerremy,
Following Dan's comment above, I felt that your "proof" about the largest triangle in a rectangle was pretty thorough, and probably couldn't be simplified without loosing clarity....hence my comment "not necessarily"...
Just in case it went by unoticed...
Cheers
Don
Following Dan's comment above, I felt that your "proof" about the largest triangle in a rectangle was pretty thorough, and probably couldn't be simplified without loosing clarity....hence my comment "not necessarily"...
Just in case it went by unoticed...
Cheers
Don
Posted on: 14 March 2004 by Don Atkinson
Dan,
I'm playing with my new camera too much.
do you want to share the details of your new camera.....or are the details elsewhere on the Forum ?
....and how can you listen to music, play with a camera AND do brain teasers simultaneaously.....
Cheers
Don
I'm playing with my new camera too much.
do you want to share the details of your new camera.....or are the details elsewhere on the Forum ?
....and how can you listen to music, play with a camera AND do brain teasers simultaneaously.....
Cheers
Don
Posted on: 14 March 2004 by Don Atkinson
Omer,
If I am not mistaken the question "does this iterative process stop for integer n" is an open one that people has been working on for some time... often mentioned as maybe undecidable
You're not mistaken.........
Cheers
Don
If I am not mistaken the question "does this iterative process stop for integer n" is an open one that people has been working on for some time... often mentioned as maybe undecidable
You're not mistaken.........
Cheers
Don
Posted on: 17 March 2004 by Don Atkinson
Triangles-again
OK, a simple one.
The big triangle is equalateral of side 2 and is made up with 4 small triangles each of side 1.
So how many small triangles are needed to make a big equalateral triangle of side 30.
And what's the "ruling equation"
Cheers
Don
OK, a simple one.
The big triangle is equalateral of side 2 and is made up with 4 small triangles each of side 1.
So how many small triangles are needed to make a big equalateral triangle of side 30.
And what's the "ruling equation"
Cheers
Don
Posted on: 17 March 2004 by Minky
Hmm.
2 side triangle = 4 side 1 triangles; 3 = 9; 4 = 16; 5 = 25 ..
so I guess for a side n triangle you need n² side 1 triangles.
30 = 900 triangles.
2 side triangle = 4 side 1 triangles; 3 = 9; 4 = 16; 5 = 25 ..
so I guess for a side n triangle you need n² side 1 triangles.
30 = 900 triangles.
Posted on: 18 March 2004 by Dan M
OFF TOPIC ALERT:
do you want to share the details of your new camera.....or are the details elsewhere on the Forum ?
....and how can you listen to music, play with a camera AND do brain teasers simultaneaously.....
And this "work" stuff keeps getting in the way.
New camera is an Voigtlander Bessa R combined with a 50mm/F2.0 Russian screw mount lens. First roll came out quite well, but I need to work on my framing of pictures using the framelines in the viewfinder. The new body was relatively inexpensive at the equivalent of around 140UKP. Light, compact, and no gimmicks. Only negative so far is that the russian lens is a bit stiff and so focusing is slower than I like. I'll play around some more before getting the Nokton (F1.5) however.
cheers,
Dan
do you want to share the details of your new camera.....or are the details elsewhere on the Forum ?
....and how can you listen to music, play with a camera AND do brain teasers simultaneaously.....
And this "work" stuff keeps getting in the way.

New camera is an Voigtlander Bessa R combined with a 50mm/F2.0 Russian screw mount lens. First roll came out quite well, but I need to work on my framing of pictures using the framelines in the viewfinder. The new body was relatively inexpensive at the equivalent of around 140UKP. Light, compact, and no gimmicks. Only negative so far is that the russian lens is a bit stiff and so focusing is slower than I like. I'll play around some more before getting the Nokton (F1.5) however.
cheers,
Dan
Posted on: 28 March 2004 by Don Atkinson
Sequences-again
Take a look at the following set of numbers
1
11
21
1211
111221
312211
13112221
1113213211
31131211131221
13211311123113112211
at first glance, they might appear to be a random collection.
However, after the first line, which is an arbitrary starting point, the rest of the lines are generated in a precise and methodical way.
Any ideas for the next line???
Cheers
Don
Take a look at the following set of numbers
1
11
21
1211
111221
312211
13112221
1113213211
31131211131221
13211311123113112211
at first glance, they might appear to be a random collection.
However, after the first line, which is an arbitrary starting point, the rest of the lines are generated in a precise and methodical way.
Any ideas for the next line???
Cheers
Don
Posted on: 28 March 2004 by Minky
11131221133112132113212221 ?
I won't explain why so that others in different time zones can have a crack.
I won't explain why so that others in different time zones can have a crack.
Posted on: 29 March 2004 by Matthew T
11131221133112132113212221
Oo, same as Minky!
Guess it might be right then!
Matthew
Oo, same as Minky!
Guess it might be right then!
Matthew
Posted on: 29 March 2004 by Matthew T
11131221133112132113212221
Oo, same as Minky!
Guess it might be right then!
Matthew
Oo, same as Minky!
Guess it might be right then!
Matthew
Posted on: 10 April 2004 by Don Atkinson
Multiple-choice tests
Many exams these days seem to be based on multiple-choice answers.
A test has 40 multiple-choice questions each with four (ABDC) possible answers.
Correct answers score +1 point; and to reduce the tendancy at guessing, wrong answers score -1 point.
What would be your expected score if you chose every answer at random
Cheers
Don
Many exams these days seem to be based on multiple-choice answers.
A test has 40 multiple-choice questions each with four (ABDC) possible answers.
Correct answers score +1 point; and to reduce the tendancy at guessing, wrong answers score -1 point.
What would be your expected score if you chose every answer at random
Cheers
Don