100 people are standing in a circle in an order 1 to 100 and 100 adjacent to 1. No.1 has a sword. He kills the next person (i.e. no. 2) and gives the sword to the next (i.e no.3). This continues until only one person remains. Which number survives at the last? Can you generalize your solution to N people? Hint: First solve the problem for powers of 2.
Monday, November 17, 2014
Monday, July 14, 2014
Birthday on a Sunday!!
It seems to me that people do not value how often their birthday falls on a Sunday, or for that matter a weekend - when many friends and relatives get a chance to wish them. So supposing your birthday falls on a Sunday this year, value it and count the number of years you need to wait until your birthday falls on a Sunday again. Do let me know your answers. Mind it, the wait can be long, but it is so worth it.
Now that you would have thought about this problem in your head, here's something that will make you grab a sheet of paper and a pen. If your birthday falls on a weekend, how long should you wait for a birthday on a weekend again? Do post your answer, for this is bound to get interesting!! Count the number of birthdays in a lifetime :)
It seems to me that people do not value how often their birthday falls on a Sunday, or for that matter a weekend - when many friends and relatives get a chance to wish them. So supposing your birthday falls on a Sunday this year, value it and count the number of years you need to wait until your birthday falls on a Sunday again. Do let me know your answers. Mind it, the wait can be long, but it is so worth it.
Now that you would have thought about this problem in your head, here's something that will make you grab a sheet of paper and a pen. If your birthday falls on a weekend, how long should you wait for a birthday on a weekend again? Do post your answer, for this is bound to get interesting!! Count the number of birthdays in a lifetime :)
Wednesday, July 22, 2009
Monday, March 09, 2009
Monday, December 22, 2008
An Interval Graph
Six professors had been to the library on the day when the rare tractate was stolen. Each had entered once, stayed for some time and then left. If two were in the library at the same time, then at least one of them saw the other. Detectives questioned the professors and gathered the following testimony:
A said he saw B and E
B reported he saw A and I
C claimed he saw D and I
D said he saw A and I
E testified to seeing B and C
I said that she saw C and E
One of the professors lied. Who was it?
Six professors had been to the library on the day when the rare tractate was stolen. Each had entered once, stayed for some time and then left. If two were in the library at the same time, then at least one of them saw the other. Detectives questioned the professors and gathered the following testimony:
A said he saw B and E
B reported he saw A and I
C claimed he saw D and I
D said he saw A and I
E testified to seeing B and C
I said that she saw C and E
One of the professors lied. Who was it?
Tuesday, March 06, 2007
Tuesday, August 16, 2005
The Plane in the Wind
An airplane flies in a straight line from airport A to airport B, then back in a straight line from B to A. It traverses with a constant engine speed and there is no wind. Will its travel time for the same round trip be greater, less, or the same if, throughout both flights, at the same engine speed, a costant wind blows from A to B?
An airplane flies in a straight line from airport A to airport B, then back in a straight line from B to A. It traverses with a constant engine speed and there is no wind. Will its travel time for the same round trip be greater, less, or the same if, throughout both flights, at the same engine speed, a costant wind blows from A to B?
Monday, July 04, 2005
Back with a bang :)
Manupulative codewords - Hofstadter's MIU system
This system of codewords have only stings of letters formed from the alphabets, M, I, U with MI as one of the codewords. You can form other codewords in the system by the following four rules :
x in the below lines can be any string of letters from M, I, U that makes a codeword in each of the rules.
1. If xI is a codeword, then xIU is also a codeword.
2. If Mx is a codeword, Mxx is also a codeword.
3. In any codeword, III can be replaced by U.
4. In any codeword, UU can be omitted.
Questions : Show that MUII is a codeword. Is MU a codeword?
Manupulative codewords - Hofstadter's MIU system
This system of codewords have only stings of letters formed from the alphabets, M, I, U with MI as one of the codewords. You can form other codewords in the system by the following four rules :
x in the below lines can be any string of letters from M, I, U that makes a codeword in each of the rules.
1. If xI is a codeword, then xIU is also a codeword.
2. If Mx is a codeword, Mxx is also a codeword.
3. In any codeword, III can be replaced by U.
4. In any codeword, UU can be omitted.
Questions : Show that MUII is a codeword. Is MU a codeword?
Thursday, July 31, 2003
Students in the Library
Five students visited the library on a certain day. The library is open from 8 AM - 8 PM on all days. Each went for a lunch at some time and returned after it. Any two of them met in the library. Prove that at some moment of time three of them were in the library. Show also that this is not always true for four students.
Hint (posted on July 27, 2005): Draw interval lines for each student for the period during which he was present.
Five students visited the library on a certain day. The library is open from 8 AM - 8 PM on all days. Each went for a lunch at some time and returned after it. Any two of them met in the library. Prove that at some moment of time three of them were in the library. Show also that this is not always true for four students.
Hint (posted on July 27, 2005): Draw interval lines for each student for the period during which he was present.
Sunday, July 20, 2003
Friday, July 18, 2003
Saturday, July 05, 2003
A non-rational path
Consider R^2 - the Euclidean plane consisting of 2-tuples of real numbers. Remove all the points that have rational co-ordinates from it. For example (1/4, 5/100) should be removed, (1/2, sqrt(7)) should NOT be removed. We are left with what is denoted R^2 - Q^2; Q being the rational points. Pick any two points a and b in R^2 - Q^2. Is it possible to find a path (a line - not nessesarily straight) from a and b in R^2 - Q^2?
If the answer is yes, give a precise path and if the answer is no, why?
Consider R^2 - the Euclidean plane consisting of 2-tuples of real numbers. Remove all the points that have rational co-ordinates from it. For example (1/4, 5/100) should be removed, (1/2, sqrt(7)) should NOT be removed. We are left with what is denoted R^2 - Q^2; Q being the rational points. Pick any two points a and b in R^2 - Q^2. Is it possible to find a path (a line - not nessesarily straight) from a and b in R^2 - Q^2?
If the answer is yes, give a precise path and if the answer is no, why?
Thursday, July 03, 2003
Count the sum of the determinants
To each positive integer with n^2 number of digits, we can associate a corresponding determinant by writing the digits in order across the rows.
That is for n = 2, we have n^2 = 4. Thus take all 4-digit positive integers. For 7615, we have the determinant
| 7 6 |
| 1 5 |
which is equal to 35 - 6 = 29.
Can you find the sum of all determinants associated with n^2-digit integers as a function of n?
Just as a motivating example - for n = 1, we have only 9 determinants and their sum is 45. For n = 2, we have 9000 determinants.
To each positive integer with n^2 number of digits, we can associate a corresponding determinant by writing the digits in order across the rows.
That is for n = 2, we have n^2 = 4. Thus take all 4-digit positive integers. For 7615, we have the determinant
| 7 6 |
| 1 5 |
which is equal to 35 - 6 = 29.
Can you find the sum of all determinants associated with n^2-digit integers as a function of n?
Just as a motivating example - for n = 1, we have only 9 determinants and their sum is 45. For n = 2, we have 9000 determinants.
Saturday, September 21, 2002
Thursday, September 12, 2002
Saturday, September 07, 2002
Thursday, September 05, 2002
I am not naming this! Well, I name it
Handshakes
At a recent convention of Scientists, there was a lot of handshakes between the scientists. But the number of Mathematicians in attendence who shook hands an odd number of times was even, why?! Remember that an handshake requires exactly two different people!
Handshakes
At a recent convention of Scientists, there was a lot of handshakes between the scientists. But the number of Mathematicians in attendence who shook hands an odd number of times was even, why?! Remember that an handshake requires exactly two different people!
Tuesday, September 03, 2002
The Frog and the Wall
Suppose there is a frog at a certain distance from a wall, say, ten feet. Imagine that this frog jumps halfway to the wall, so that he is five feet away. Suppose he continues to jump toward the wall, each time getting halfway there. Will the frog reach the wall?
Another Question will follow in this context!
Suppose there is a frog at a certain distance from a wall, say, ten feet. Imagine that this frog jumps halfway to the wall, so that he is five feet away. Suppose he continues to jump toward the wall, each time getting halfway there. Will the frog reach the wall?
Another Question will follow in this context!
Monday, August 19, 2002
The Structure of the Universe
We say that space is three-dimensional. But in the world of Mathematics, though, we are not limited by physical constraints!! We might have four, five, or six geometric dimensions, or even infinitely many!!!
Let's go back to two-space. Thos might be a plane or the surface of a smooth objects. Suppose we have little cretures on this two-dimensional surface. Their movements are limited compared to what we are used to.
Imagine one of these two-dimensional creatures, imprisoned inside a square. He cannot get out. But it is easy for us to think of a way to get him out: reach in, grab him, yank him off the two-dimensional surface that is his universe, and plop him out down outside the square! So easy for us, but impossible for him, or anyone else in his universe.
We can extend this idea to our own universe. Suppose somebody is locked in a cubicle that cannot be broken open. There is no escape unless the walls are breached. But a four-dimensional being, looking at this poor three-space person, could quite easily grab him and pull him ouot without the walls of the cubicle even being touched. We cannot envision how this could be done, but mathematically it could be, if we allow four dimensions to exist. More on this in Flatland.
There is another way a person could escape from the cubicle, and the method is easy for us to imagine. Figure it out!!
We say that space is three-dimensional. But in the world of Mathematics, though, we are not limited by physical constraints!! We might have four, five, or six geometric dimensions, or even infinitely many!!!
Let's go back to two-space. Thos might be a plane or the surface of a smooth objects. Suppose we have little cretures on this two-dimensional surface. Their movements are limited compared to what we are used to.
Imagine one of these two-dimensional creatures, imprisoned inside a square. He cannot get out. But it is easy for us to think of a way to get him out: reach in, grab him, yank him off the two-dimensional surface that is his universe, and plop him out down outside the square! So easy for us, but impossible for him, or anyone else in his universe.
We can extend this idea to our own universe. Suppose somebody is locked in a cubicle that cannot be broken open. There is no escape unless the walls are breached. But a four-dimensional being, looking at this poor three-space person, could quite easily grab him and pull him ouot without the walls of the cubicle even being touched. We cannot envision how this could be done, but mathematically it could be, if we allow four dimensions to exist. More on this in Flatland.
There is another way a person could escape from the cubicle, and the method is easy for us to imagine. Figure it out!!
Subscribe to:
Posts (Atom)