<?xml version='1.0' encoding='UTF-8'?><?xml-stylesheet href="http://www.blogger.com/styles/atom.css" type="text/css"?><feed xmlns='http://www.w3.org/2005/Atom' xmlns:openSearch='http://a9.com/-/spec/opensearchrss/1.0/' xmlns:georss='http://www.georss.org/georss' xmlns:gd='http://schemas.google.com/g/2005' xmlns:thr='http://purl.org/syndication/thread/1.0'><id>tag:blogger.com,1999:blog-3587240</id><updated>2011-07-28T20:07:58.975-05:00</updated><title type='text'>Puzzles collected at random</title><subtitle type='html'>A place for puzzles</subtitle><link rel='http://schemas.google.com/g/2005#feed' type='application/atom+xml' href='http://puzzling.blogspot.com/feeds/posts/default'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default?max-results=100'/><link rel='alternate' type='text/html' href='http://puzzling.blogspot.com/'/><link rel='hub' href='http://pubsubhubbub.appspot.com/'/><author><name>Lavanya</name><uri>http://www.blogger.com/profile/14123070597007673219</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author><generator version='7.00' uri='http://www.blogger.com'>Blogger</generator><openSearch:totalResults>29</openSearch:totalResults><openSearch:startIndex>1</openSearch:startIndex><openSearch:itemsPerPage>100</openSearch:itemsPerPage><entry><id>tag:blogger.com,1999:blog-3587240.post-1232258608942708190</id><published>2009-07-22T23:43:00.003-05:00</published><updated>2009-07-22T23:47:29.510-05:00</updated><title type='text'></title><summary type='text'>Fair experiment with unfair coin!The puzzle is simple to state: You are given a biased coin with 60% chance for getting heads and 40% chance of getting tails while tossing. Design an experiment with two equally likely outcomes using the coin.</summary><link rel='replies' type='application/atom+xml' href='http://puzzling.blogspot.com/feeds/1232258608942708190/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=3587240&amp;postID=1232258608942708190' title='1 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default/1232258608942708190'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default/1232258608942708190'/><link rel='alternate' type='text/html' href='http://puzzling.blogspot.com/2009/07/fair-experiment-with-unfair-coin-puzzle.html' title=''/><author><name>Lavanya</name><uri>http://www.blogger.com/profile/14123070597007673219</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author><thr:total>1</thr:total></entry><entry><id>tag:blogger.com,1999:blog-3587240.post-7501395683823208782</id><published>2009-03-09T21:10:00.003-05:00</published><updated>2009-03-09T21:18:14.330-05:00</updated><title type='text'></title><summary type='text'>Think out of the box!2 rooms, 1 light bulb in one room and the other room has 3 switches out of which only one of the light bulb switches on/off. The rooms are not viewable from each other. You as a single person has just one chance to find which switch operates the bulb. How can this be done?</summary><link rel='replies' type='application/atom+xml' href='http://puzzling.blogspot.com/feeds/7501395683823208782/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=3587240&amp;postID=7501395683823208782' title='2 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default/7501395683823208782'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default/7501395683823208782'/><link rel='alternate' type='text/html' href='http://puzzling.blogspot.com/2009/03/think-out-of-box-2-rooms-1-light-bulb.html' title=''/><author><name>Lavanya</name><uri>http://www.blogger.com/profile/14123070597007673219</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author><thr:total>2</thr:total></entry><entry><id>tag:blogger.com,1999:blog-3587240.post-6910162311373772153</id><published>2008-12-22T22:04:00.002-06:00</published><updated>2008-12-22T22:13:24.113-06:00</updated><title type='text'></title><summary type='text'>An Interval GraphSix 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 EB reported he saw A and IC claimed he saw D and ID said </summary><link rel='replies' type='application/atom+xml' href='http://puzzling.blogspot.com/feeds/6910162311373772153/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=3587240&amp;postID=6910162311373772153' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default/6910162311373772153'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default/6910162311373772153'/><link rel='alternate' type='text/html' href='http://puzzling.blogspot.com/2008/12/interval-graph-six-professors-had-been.html' title=''/><author><name>Lavanya</name><uri>http://www.blogger.com/profile/14123070597007673219</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-3587240.post-4601920085449332469</id><published>2007-03-06T15:31:00.000-06:00</published><updated>2007-03-06T15:34:26.467-06:00</updated><title type='text'></title><summary type='text'>Unit distance coloringImagine that each point on the plane takes a color. What is the minimum number of colors needed to color all the points so that any two points which are at distance exactly 1 unit get two different colors?</summary><link rel='replies' type='application/atom+xml' href='http://puzzling.blogspot.com/feeds/4601920085449332469/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=3587240&amp;postID=4601920085449332469' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default/4601920085449332469'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default/4601920085449332469'/><link rel='alternate' type='text/html' href='http://puzzling.blogspot.com/2007/03/unit-distance-coloring-imagine-that.html' title=''/><author><name>Lavanya</name><uri>http://www.blogger.com/profile/14123070597007673219</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-3587240.post-112424240762114122</id><published>2005-08-16T20:28:00.000-05:00</published><updated>2005-08-16T20:33:27.626-05:00</updated><title type='text'></title><summary type='text'>The Plane in the WindAn 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?</summary><link rel='replies' type='application/atom+xml' href='http://puzzling.blogspot.com/feeds/112424240762114122/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=3587240&amp;postID=112424240762114122' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default/112424240762114122'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default/112424240762114122'/><link rel='alternate' type='text/html' href='http://puzzling.blogspot.com/2005/08/plane-in-wind-airplane-flies-in.html' title=''/><author><name>Lavanya</name><uri>http://www.blogger.com/profile/14123070597007673219</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-3587240.post-112049493791618731</id><published>2005-07-04T11:20:00.000-05:00</published><updated>2005-07-04T11:35:37.946-05:00</updated><title type='text'></title><summary type='text'>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.&lt;!-- MATH  $xI\in \mathcal{T}$  </summary><link rel='replies' type='application/atom+xml' href='http://puzzling.blogspot.com/feeds/112049493791618731/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=3587240&amp;postID=112049493791618731' title='1 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default/112049493791618731'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default/112049493791618731'/><link rel='alternate' type='text/html' href='http://puzzling.blogspot.com/2005/07/back-with-bang-manupulative-codewords.html' title=''/><author><name>Lavanya</name><uri>http://www.blogger.com/profile/14123070597007673219</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author><thr:total>1</thr:total></entry><entry><id>tag:blogger.com,1999:blog-3587240.post-105968302134672968</id><published>2003-07-31T15:23:00.000-05:00</published><updated>2005-07-27T11:02:07.400-05:00</updated><title type='text'></title><summary type='text'>Students in the LibraryFive 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 </summary><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default/105968302134672968'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default/105968302134672968'/><link rel='alternate' type='text/html' href='http://puzzling.blogspot.com/2003/07/students-in-library-five-students.html' title=''/><author><name>Lavanya</name><uri>http://www.blogger.com/profile/14123070597007673219</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-3587240.post-105872152922970727</id><published>2003-07-20T12:18:00.000-05:00</published><updated>2003-07-20T12:18:49.186-05:00</updated><title type='text'></title><summary type='text'>Girlie company25 boys and 25 girls are to be seated in a round table with 50 seats.  Prove that no matter what the arrangement is, there would be a person who is seated in-between two girls.</summary><link rel='replies' type='application/atom+xml' href='http://puzzling.blogspot.com/feeds/105872152922970727/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=3587240&amp;postID=105872152922970727' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default/105872152922970727'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default/105872152922970727'/><link rel='alternate' type='text/html' href='http://puzzling.blogspot.com/2003/07/girlie-company-25-boys-and-25-girls.html' title=''/><author><name>Lavanya</name><uri>http://www.blogger.com/profile/14123070597007673219</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-3587240.post-105853453406880607</id><published>2003-07-18T08:22:00.000-05:00</published><updated>2003-07-18T08:23:20.096-05:00</updated><title type='text'></title><summary type='text'>The hole principleLet  A = (a_1, a_2,...,a_n) be a sequence on real numbers with n &gt; k m (k and m - integers). Prove that there is a subsequence of length k +1 of A of which is increasing OR a subsequence of length m +1 of A of which is decreasing.</summary><link rel='replies' type='application/atom+xml' href='http://puzzling.blogspot.com/feeds/105853453406880607/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=3587240&amp;postID=105853453406880607' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default/105853453406880607'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default/105853453406880607'/><link rel='alternate' type='text/html' href='http://puzzling.blogspot.com/2003/07/hole-principle-let-a1-a2.html' title=''/><author><name>Lavanya</name><uri>http://www.blogger.com/profile/14123070597007673219</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-3587240.post-105744053660982105</id><published>2003-07-05T16:28:00.000-05:00</published><updated>2003-07-05T18:03:42.210-05:00</updated><title type='text'></title><summary type='text'>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 - </summary><link rel='replies' type='application/atom+xml' href='http://puzzling.blogspot.com/feeds/105744053660982105/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=3587240&amp;postID=105744053660982105' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default/105744053660982105'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default/105744053660982105'/><link rel='alternate' type='text/html' href='http://puzzling.blogspot.com/2003/07/non-rational-path-consider-r2.html' title=''/><author><name>Lavanya</name><uri>http://www.blogger.com/profile/14123070597007673219</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-3587240.post-105728931521399891</id><published>2003-07-03T22:28:00.000-05:00</published><updated>2003-07-04T15:35:20.696-05:00</updated><title type='text'></title><summary type='text'>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 </summary><link rel='replies' type='application/atom+xml' href='http://puzzling.blogspot.com/feeds/105728931521399891/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=3587240&amp;postID=105728931521399891' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default/105728931521399891'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default/105728931521399891'/><link rel='alternate' type='text/html' href='http://puzzling.blogspot.com/2003/07/count-sum-of-determinants-to-each.html' title=''/><author><name>Lavanya</name><uri>http://www.blogger.com/profile/14123070597007673219</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-3587240.post-105727507812779037</id><published>2003-07-03T18:31:00.000-05:00</published><updated>2003-07-03T18:31:18.076-05:00</updated><title type='text'></title><summary type='text'>A computational ProblemLet x = .1234567891011121314...998999, where the digits are obtained by writing the integers 1 through 999 in order. Find the 1983rd digit to the right of the decimal point.</summary><link rel='replies' type='application/atom+xml' href='http://puzzling.blogspot.com/feeds/105727507812779037/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=3587240&amp;postID=105727507812779037' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default/105727507812779037'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default/105727507812779037'/><link rel='alternate' type='text/html' href='http://puzzling.blogspot.com/2003/07/computational-problem-let-x.html' title=''/><author><name>Lavanya</name><uri>http://www.blogger.com/profile/14123070597007673219</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-3587240.post-81936795</id><published>2002-09-21T22:41:00.000-05:00</published><updated>2003-03-25T21:19:23.000-06:00</updated><title type='text'></title><summary type='text'>Can the mouse eat the cube?A mouse eats its way through a 3*3*3 cube of cheese by tunnelling through all of the 27 1*1*1 subcubes. If he starts at one corner and always moves on to an adjacent uneaten subcube, can he finish at the center of the cube? </summary><link rel='replies' type='application/atom+xml' href='http://puzzling.blogspot.com/feeds/81936795/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=3587240&amp;postID=81936795' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default/81936795'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default/81936795'/><link rel='alternate' type='text/html' href='http://puzzling.blogspot.com/2002/09/can-mouse-eat-cube-mouse-eats-its-way.html' title=''/><author><name>Lavanya</name><uri>http://www.blogger.com/profile/14123070597007673219</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-3587240.post-81505174</id><published>2002-09-12T08:45:00.000-05:00</published><updated>2002-09-12T08:45:25.376-05:00</updated><title type='text'></title><summary type='text'>More on PrimesProve that there is atleast one prime number between n and 2n.</summary><link rel='replies' type='application/atom+xml' href='http://puzzling.blogspot.com/feeds/81505174/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=3587240&amp;postID=81505174' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default/81505174'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default/81505174'/><link rel='alternate' type='text/html' href='http://puzzling.blogspot.com/2002/09/more-on-primes-prove-that-there-is.html' title=''/><author><name>Lavanya</name><uri>http://www.blogger.com/profile/14123070597007673219</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-3587240.post-81298688</id><published>2002-09-07T21:32:00.000-05:00</published><updated>2002-09-07T21:32:51.250-05:00</updated><title type='text'></title><summary type='text'>Consecutive no-prime numbersTell me 1000 consecutive non-prime numbers.</summary><link rel='replies' type='application/atom+xml' href='http://puzzling.blogspot.com/feeds/81298688/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=3587240&amp;postID=81298688' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default/81298688'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default/81298688'/><link rel='alternate' type='text/html' href='http://puzzling.blogspot.com/2002/09/consecutive-no-prime-numbers-tell-me.html' title=''/><author><name>Lavanya</name><uri>http://www.blogger.com/profile/14123070597007673219</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-3587240.post-81215868</id><published>2002-09-05T21:00:00.000-05:00</published><updated>2002-09-06T18:48:47.000-05:00</updated><title type='text'></title><summary type='text'>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!</summary><link rel='replies' type='application/atom+xml' href='http://puzzling.blogspot.com/feeds/81215868/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=3587240&amp;postID=81215868' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default/81215868'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default/81215868'/><link rel='alternate' type='text/html' href='http://puzzling.blogspot.com/2002/09/i-am-not-naming-this-well-i-name-it.html' title=''/><author><name>Lavanya</name><uri>http://www.blogger.com/profile/14123070597007673219</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-3587240.post-81120390</id><published>2002-09-03T21:31:00.000-05:00</published><updated>2002-09-03T21:31:47.530-05:00</updated><title type='text'></title><summary type='text'>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!</summary><link rel='replies' type='application/atom+xml' href='http://puzzling.blogspot.com/feeds/81120390/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=3587240&amp;postID=81120390' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default/81120390'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default/81120390'/><link rel='alternate' type='text/html' href='http://puzzling.blogspot.com/2002/09/frog-and-wall-suppose-there-is-frog-at.html' title=''/><author><name>Lavanya</name><uri>http://www.blogger.com/profile/14123070597007673219</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-3587240.post-80431821</id><published>2002-08-19T10:41:00.000-05:00</published><updated>2002-08-19T10:44:38.000-05:00</updated><title type='text'></title><summary type='text'>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 </summary><link rel='replies' type='application/atom+xml' href='http://puzzling.blogspot.com/feeds/80431821/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=3587240&amp;postID=80431821' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default/80431821'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default/80431821'/><link rel='alternate' type='text/html' href='http://puzzling.blogspot.com/2002/08/structure-of-universe-we-say-that.html' title=''/><author><name>Lavanya</name><uri>http://www.blogger.com/profile/14123070597007673219</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-3587240.post-80261179</id><published>2002-08-14T23:11:00.000-05:00</published><updated>2002-08-14T23:13:31.000-05:00</updated><title type='text'></title><summary type='text'>Tricky TrackThree High schools-Washington, Lincoln and Roosevelt-competed in a track meet. Each school entered one man, and one only, in each event. Susan, a student of Lincoln High, sat in the bleachers to cheer her boyfriend, the school's shot-put champion.When Susan returned home later in the day, her father asked how her school had done."We won the shot-put all right," she said,"but </summary><link rel='replies' type='application/atom+xml' href='http://puzzling.blogspot.com/feeds/80261179/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=3587240&amp;postID=80261179' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default/80261179'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default/80261179'/><link rel='alternate' type='text/html' href='http://puzzling.blogspot.com/2002/08/tricky-track-three-high-schools.html' title=''/><author><name>Lavanya</name><uri>http://www.blogger.com/profile/14123070597007673219</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-3587240.post-80191099</id><published>2002-08-13T11:50:00.000-05:00</published><updated>2002-08-13T11:55:30.000-05:00</updated><title type='text'></title><summary type='text'>The Twin Paradox This blog is as a result of my own attempt to understand a difficult-to-understand paradox, Twin Paradox which is an outcome of of Einstein's relativity (Any physicians around?!). Please tell me if you see anything insightful!(I have question-marked whatever I did not understand!)Suppose we have two twin brothers, in spaceships somewhere in the intergalactic void where there </summary><link rel='replies' type='application/atom+xml' href='http://puzzling.blogspot.com/feeds/80191099/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=3587240&amp;postID=80191099' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default/80191099'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default/80191099'/><link rel='alternate' type='text/html' href='http://puzzling.blogspot.com/2002/08/twin-paradox-this-blog-is-as-result-of.html' title=''/><author><name>Lavanya</name><uri>http://www.blogger.com/profile/14123070597007673219</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-3587240.post-80035368</id><published>2002-08-09T13:05:00.000-05:00</published><updated>2002-08-09T18:30:43.000-05:00</updated><title type='text'></title><summary type='text'>A Band Around The WorldSuppose the earth were a smooth, perfectly round sphere, with no hills or mountains. Imagine a rope around the earth's equator, strung so that it is snug and does not strech. If we were to add, say, ten feet to this rope, and then prop it up all the way around the planet so that it stood out equally far everywhere, how far above the surface would it stand? We can assume </summary><link rel='replies' type='application/atom+xml' href='http://puzzling.blogspot.com/feeds/80035368/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=3587240&amp;postID=80035368' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default/80035368'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default/80035368'/><link rel='alternate' type='text/html' href='http://puzzling.blogspot.com/2002/08/band-around-world-suppose-earth-were.html' title=''/><author><name>Lavanya</name><uri>http://www.blogger.com/profile/14123070597007673219</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-3587240.post-79835258</id><published>2002-08-05T01:24:00.000-05:00</published><updated>2002-08-05T01:35:43.000-05:00</updated><title type='text'></title><summary type='text'>A Fixed-Point Theorem One Morning, exactly at sunrise, a Buddhist monk began to climb a tall mountain. The narrow path, no more than a foot or two wide, spiraled around the mountain to a glittering temple at the summit.The monk ascended the path at varying rates of speed, stopping many times along the way to rest and to eat the dried fruit he carried with him.He reached the temple shortly before</summary><link rel='replies' type='application/atom+xml' href='http://puzzling.blogspot.com/feeds/79835258/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=3587240&amp;postID=79835258' title='1 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default/79835258'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default/79835258'/><link rel='alternate' type='text/html' href='http://puzzling.blogspot.com/2002/08/fixed-point-theorem-one-morning.html' title=''/><author><name>Lavanya</name><uri>http://www.blogger.com/profile/14123070597007673219</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author><thr:total>1</thr:total></entry><entry><id>tag:blogger.com,1999:blog-3587240.post-79456016</id><published>2002-07-26T17:53:00.000-05:00</published><updated>2002-07-27T00:20:10.000-05:00</updated><title type='text'></title><summary type='text'>The Car-and-Goats IIThis is a continuation of the previous question... If the car is actually at Door I (probability 1/3), then when you switch you lose; but if it is at Door 2 or Door 3(probability 2/3) then the host's revelation of a goat shows you how to switch and win. Therefore the chance you win by switching is 2/3. Elegant. But in this argument, we are still considering the possibility </summary><link rel='replies' type='application/atom+xml' href='http://puzzling.blogspot.com/feeds/79456016/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=3587240&amp;postID=79456016' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default/79456016'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default/79456016'/><link rel='alternate' type='text/html' href='http://puzzling.blogspot.com/2002/07/car-and-goats-ii-this-is-continuation.html' title=''/><author><name>Lavanya</name><uri>http://www.blogger.com/profile/14123070597007673219</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-3587240.post-79391228</id><published>2002-07-25T08:34:00.000-05:00</published><updated>2002-08-05T01:34:49.000-05:00</updated><title type='text'></title><summary type='text'>The Car-and-GoatsA number of mathematicians were thrown into a tizzy by the following problem, which appeared in Marilyn vos Savant's column, "Ask Marilyn", in Parade(a Sunday newspaper supplement):One of the three doors hides a car (all three equally likely) and other two hide goats. You choose Door 1. The host, who knows where the car is, then opens one of the other two doors to reveal a goat</summary><link rel='replies' type='application/atom+xml' href='http://puzzling.blogspot.com/feeds/79391228/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=3587240&amp;postID=79391228' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default/79391228'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default/79391228'/><link rel='alternate' type='text/html' href='http://puzzling.blogspot.com/2002/07/car-and-goats-number-of-mathematicians.html' title=''/><author><name>Lavanya</name><uri>http://www.blogger.com/profile/14123070597007673219</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-3587240.post-78647179</id><published>2002-07-07T08:15:00.000-05:00</published><updated>2002-08-05T01:36:40.000-05:00</updated><title type='text'></title><summary type='text'>Random Hats Three people are given hats. Each hat is either red or blue, chosen at random. Each person can see the other 2 hats, but not their own. They each must simultaneously either guess their own hat's color, or pass. No communication is allowed, although they can agree on a strategy ahead of time. What strategy will give them the best chances of at least one person guessing right, and </summary><link rel='replies' type='application/atom+xml' href='http://puzzling.blogspot.com/feeds/78647179/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=3587240&amp;postID=78647179' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default/78647179'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default/78647179'/><link rel='alternate' type='text/html' href='http://puzzling.blogspot.com/2002/07/random-hats-three-people-are-given.html' title=''/><author><name>Lavanya</name><uri>http://www.blogger.com/profile/14123070597007673219</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-3587240.post-78523355</id><published>2002-07-03T16:12:00.000-05:00</published><updated>2002-08-05T01:37:26.000-05:00</updated><title type='text'></title><summary type='text'>Probability While your back is turned, a friend places a penny, nickel, and dime on the table. He arranges them in a pattern of heads and tails provided that the three coins are not all heads or all tails.Your object is to give instructions, without seeing the coins, that will cause all heads to be the same (all heads or all tails). For example, you may ask your friend to reverse the dime. He </summary><link rel='replies' type='application/atom+xml' href='http://puzzling.blogspot.com/feeds/78523355/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=3587240&amp;postID=78523355' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default/78523355'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default/78523355'/><link rel='alternate' type='text/html' href='http://puzzling.blogspot.com/2002/07/probability-while-your-back-is-turned.html' title=''/><author><name>Lavanya</name><uri>http://www.blogger.com/profile/14123070597007673219</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-3587240.post-78011389</id><published>2002-06-20T23:40:00.000-05:00</published><updated>2002-07-27T00:37:51.000-05:00</updated><title type='text'></title><summary type='text'>Guess the numbersTwo mathematicians are placed in two rooms and one is given the sum of twodistinct numbers between 2 and 99 (2 and 99 excluded) and the other is giventhe product of same two numbers.   They both come out of the room and thefollowing conversation takes place.Mathematician with product : "I don't know the two numbers".Mathematician with sum : "I know, you won't know the two </summary><link rel='replies' type='application/atom+xml' href='http://puzzling.blogspot.com/feeds/78011389/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=3587240&amp;postID=78011389' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default/78011389'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default/78011389'/><link rel='alternate' type='text/html' href='http://puzzling.blogspot.com/2002/06/guess-numbers-two-mathematicians-are.html' title=''/><author><name>Lavanya</name><uri>http://www.blogger.com/profile/14123070597007673219</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-3587240.post-77983826</id><published>2002-06-20T11:12:00.000-05:00</published><updated>2002-06-20T11:12:04.830-05:00</updated><title type='text'></title><summary type='text'>Hi there, I installed YACCS, so you can comment!</summary><link rel='replies' type='application/atom+xml' href='http://puzzling.blogspot.com/feeds/77983826/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=3587240&amp;postID=77983826' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default/77983826'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default/77983826'/><link rel='alternate' type='text/html' href='http://puzzling.blogspot.com/2002/06/hi-there-i-installed-yaccs-so-you-can.html' title=''/><author><name>Lavanya</name><uri>http://www.blogger.com/profile/14123070597007673219</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-3587240.post-77980103</id><published>2002-06-20T09:32:00.000-05:00</published><updated>2002-06-20T11:06:06.000-05:00</updated><title type='text'></title><summary type='text'>Mirror, Mirror...I found this problem in "No Ordinary Genius" by Christopher Sykes. It's pretty easy. But I do not have an answer!You look in a mirror, and let's say you part your hair on the right side. You look in the mirror, and your image has its hair parted on the left side, so the image is left-to-right mixed up. But it's not top-to-bottom mixed up, because the top of the head of the </summary><link rel='replies' type='application/atom+xml' href='http://puzzling.blogspot.com/feeds/77980103/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=3587240&amp;postID=77980103' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default/77980103'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/3587240/posts/default/77980103'/><link rel='alternate' type='text/html' href='http://puzzling.blogspot.com/2002/06/mirror-mirror.html' title=''/><author><name>Lavanya</name><uri>http://www.blogger.com/profile/14123070597007673219</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry></feed>
