<?xml version="1.0" encoding="ISO-8859-1" ?>
<rss version="2.0">
<channel>
	<title>BrainDen.com - New Logic/Math Puzzles</title>
	<description>New puzzles recently submitted to BrainDen.com - Brain Teasers Forum.</description>
	<link>http://brainden.com/forum/index.php</link>
	<pubDate>Fri, 20 Nov 2009 20:07:03 +0000</pubDate>
	<ttl>5</ttl>
	<item>
		<title>Interleaving strings with overlap</title>
		<link>http://brainden.com/forum/index.php?/topic/10710-interleaving-strings-with-overlap/</link>
		<description><![CDATA[Interleave the three 19-long strings<br />
<pre class='prettyprint'>
MOTMMNEEITEAEOENANU
HWOCOMNTSNWOLRYDGSI
TETSOLEHRDHRDTPIDTY
</pre><br />
so that they may overlap only at<br />
letters they have in common and<br />
together they form the shortest<br />
possible string (not necessarily<br />
an English sentence).<br />
<br />
Here is example solved problem of<br />
this type:<br />
Suppose that the three strings were<br />
<pre class='prettyprint'>
HEGOOMOASUTYPOATHII
EISPLLIHTOPRLMTHTSS
RADEXAEFOTONTOEEFBE
</pre><br />
Each of these can be stretched out over 45 positions<br />
so that each of the 45 positions is covered by a<br />
letter from at least one of the three.  Furthermore,<br />
letters at positions of overlap must agree:<br />
<pre class='prettyprint'>
            HE GO O    MOASUTYPO    A T  HII
   EISPLL  IH    TO PRLM    T        HTSS
RADE     XA  EF OTON        T  OEEFB        E

RADEISPLLXAIHEFGOTONPRLMOASUTYPOEEFBAHTSSHIIE
</pre><br />
This 45-long string, although not unique, is as<br />
short as possible while fulfilling the requirements<br />
of the problem.]]></description>
		<pubDate>Fri, 20 Nov 2009 20:07:03 +0000</pubDate>
		<guid>http://brainden.com/forum/index.php?/topic/10710-interleaving-strings-with-overlap/</guid>
	</item>
	<item>
		<title>Interleaving strings without overlap</title>
		<link>http://brainden.com/forum/index.php?/topic/10709-interleaving-strings-without-overlap/</link>
		<description><![CDATA[Interleave the three 19-long strings<br />
<pre class='prettyprint'>
MOTMMNEEITEAEOENANU
HWOCOMNTSNWOLRYDGSI
TETSOLEHRDHRDTPIDTY
</pre><br />
so that they don't overlap and<br />
together they form a 57-long string<br />
which is a good English sentence<br />
with the spaces collapsed out.<br />
<br />
Here is example solved problem of<br />
this type:<br />
Suppose that the three strings were<br />
<pre class='prettyprint'>
HEGOOMOASUTYPOATHII
EISPLLIHTOPRLMTHTSS
RADEXAEFOTONTOEEFBE
</pre><br />
Each of these can be stretched out over 57 positions<br />
so that they do not overlap and each of the 57 positions<br />
is used by at least one of them this way:<br />
<pre class='prettyprint'>
HE     GOO    M   O AS  U      T   YP     O      A THI I
   EIS         PL      L  I     H T   O PR  L MTH T   S S
  R   A   DEXA   E F  O  T ONTO  E   E F   B E

HEREISAGOODEXAMPLEOFASOLUTIONTOTHETYPEOFPROBLEMTHATTHISIS
</pre>]]></description>
		<pubDate>Fri, 20 Nov 2009 20:05:20 +0000</pubDate>
		<guid>http://brainden.com/forum/index.php?/topic/10709-interleaving-strings-without-overlap/</guid>
	</item>
	<item>
		<title>Which is the odd one out?</title>
		<link>http://brainden.com/forum/index.php?/topic/10708-which-is-the-odd-one-out/</link>
		<description><![CDATA[Which of these words is the odd one out?<br />
<br />
easter<br />
<br />
homily<br />
<br />
jumping<br />
<br />
pumpkin<br />
<br />
scared]]></description>
		<pubDate>Fri, 20 Nov 2009 20:02:45 +0000</pubDate>
		<guid>http://brainden.com/forum/index.php?/topic/10708-which-is-the-odd-one-out/</guid>
	</item>
	<item>
		<title>What could you do with this?</title>
		<link>http://brainden.com/forum/index.php?/topic/10706-what-could-you-do-with-this/</link>
		<description>HIJKLMNO</description>
		<pubDate>Fri, 20 Nov 2009 09:32:49 +0000</pubDate>
		<guid>http://brainden.com/forum/index.php?/topic/10706-what-could-you-do-with-this/</guid>
	</item>
	<item>
		<title>weights</title>
		<link>http://brainden.com/forum/index.php?/topic/10705-weights/</link>
		<description><![CDATA[there are 5 balls with same shape but different weights; 1,2,3,4,5 grams.<br />
you have an electronic scale. you have to put 3 balls on the scale for every measurement. how many measurement is required at minimum to guarantee to know the weights of all balls.]]></description>
		<pubDate>Fri, 20 Nov 2009 07:01:18 +0000</pubDate>
		<guid>http://brainden.com/forum/index.php?/topic/10705-weights/</guid>
	</item>
	<item>
		<title>Circling Numbers</title>
		<link>http://brainden.com/forum/index.php?/topic/10703-circling-numbers/</link>
		<description><![CDATA[Here's a quick one before the weekend...<br />
<br />
You arrange the digits 1 through 9 in a circle (or a modular/wrap around line).  You then find the largest sum formed by any three digits in a row from your circle.<br />
<br />
What is the smallest sum you can obtain?  Show one such solution to the circle.]]></description>
		<pubDate>Thu, 19 Nov 2009 18:10:15 +0000</pubDate>
		<guid>http://brainden.com/forum/index.php?/topic/10703-circling-numbers/</guid>
	</item>
	<item>
		<title>Consecutive Integers and Sum Puzzle</title>
		<link>http://brainden.com/forum/index.php?/topic/10699-consecutive-integers-and-sum-puzzle/</link>
		<description><![CDATA[Prove that the sum of the squares of 2007 consecutive integers cannot be the n-th power of an integer, whenever n is any integer &gt;=2.]]></description>
		<pubDate>Thu, 19 Nov 2009 07:16:23 +0000</pubDate>
		<guid>http://brainden.com/forum/index.php?/topic/10699-consecutive-integers-and-sum-puzzle/</guid>
	</item>
	<item>
		<title>Digit Separation and Extreme Values Puzzle</title>
		<link>http://brainden.com/forum/index.php?/topic/10698-digit-separation-and-extreme-values-puzzle/</link>
		<description><![CDATA[A base ten 10-digit positive integer N contains precisely two 4s, two 3s, two 2s, two 1s and two 0s.<br />
<br />
The 4s are separated by four digits, the 3s are separated by three digits, the 2s by two digits, the 1s by one digit and the 0s by no digits.<br />
<br />
Determine the respective minimum value and the maximum value of N. It is known that N cannot contain any leading zero.]]></description>
		<pubDate>Thu, 19 Nov 2009 07:11:13 +0000</pubDate>
		<guid>http://brainden.com/forum/index.php?/topic/10698-digit-separation-and-extreme-values-puzzle/</guid>
	</item>
	<item>
		<title>pleas fallow the rules</title>
		<link>http://brainden.com/forum/index.php?/topic/10697-pleas-fallow-the-rules/</link>
		<description><![CDATA[There is a land far far away,<br />
That if you opened the door, <br />
You get there almost right away,<br />
The door is hidden in your thoughts,<br />
To dig it up takes quite a lot,<br />
Some take pills,<br />
Others use thrills,<br />
But they never work exactly the same,<br />
Where is this land,<br />
Can you tell me,<br />
And how to get there,<br />
I need to know to.<br />
<br />
rules:<br />
<br />
don't cheat. no peaking at the spoiler.<br />
read it over and over till you get it.<br />
and no looking at other spoilers.<br />
my oh my this will be fun<br />
<br />
<div class='bbc_spoiler'>
	<span>Spoiler</span> for  <input type='button' class='bbc_spoiler_show' value='Show' />
	<div class='bbc_spoiler_wrapper'><div class='bbc_spoiler_content' style="display:none;">you cheated!</div></div>
</div>]]></description>
		<pubDate>Thu, 19 Nov 2009 02:27:13 +0000</pubDate>
		<guid>http://brainden.com/forum/index.php?/topic/10697-pleas-fallow-the-rules/</guid>
	</item>
	<item>
		<title>Gibberish????</title>
		<link>http://brainden.com/forum/index.php?/topic/10696-gibberish/</link>
		<description><![CDATA[Personally, I would give this puzzle a difficulty rating of 2 stars, however, it seems more difficult when you don't know how it works.<br />
<br />
A mysterious message was found in the school caf้teria, the principal, being the post-9/11 paranoid that he is, fears that this may be a death threat, but his naive vice-principal believes that it simply a bunch of harmless gibberish.  The principal is not so easily comforted, so he offers a $50 reward to anyone who can tell him what the message says.<br />
<br />
<img src="http://brainden.com/forum/uploads/post-13995-12585860215423.png" class='bbc_img linked-image' alt="" />]]></description>
		<pubDate>Wed, 18 Nov 2009 23:14:43 +0000</pubDate>
		<guid>http://brainden.com/forum/index.php?/topic/10696-gibberish/</guid>
	</item>
	<item>
		<title>Which day?</title>
		<link>http://brainden.com/forum/index.php?/topic/10695-which-day/</link>
		<description><![CDATA[Hi, <br />
<br />
Need help on this question. On which of the two days of the week, Saturday or Sunday, does New Year's Day fall more often?]]></description>
		<pubDate>Wed, 18 Nov 2009 14:24:19 +0000</pubDate>
		<guid>http://brainden.com/forum/index.php?/topic/10695-which-day/</guid>
	</item>
	<item>
		<title>How many ways</title>
		<link>http://brainden.com/forum/index.php?/topic/10693-how-many-ways/</link>
		<description><![CDATA[A robot is given a 4-letter name and 4-letter surname, using the letters of the 26-letter alphabet. None of the letters used in the name is used in the surname. <br />
<br />
In how many different ways can this be done?<br />
<br />
Example: "VGGA NNEN"]]></description>
		<pubDate>Wed, 18 Nov 2009 12:23:05 +0000</pubDate>
		<guid>http://brainden.com/forum/index.php?/topic/10693-how-many-ways/</guid>
	</item>
	<item>
		<title>Interesting Poker Puzzle-- If You Like Poker</title>
		<link>http://brainden.com/forum/index.php?/topic/10692-interesting-poker-puzzle-if-you-like-poker/</link>
		<description><![CDATA[Here's a poker puzzle. It helps if you have a basic understanding of Hold 'Em. <br />
<br />
A dinner host has invited N guests to enjoy a meal. At the end of the meal, he will offer each guest a two card Hold 'Em hand. The winner of the hand will receive a nice door prize. He then deals a rigged three card flop and fourth card in the middle of the table (by rigged, I mean he has set the cards ahead of time). If you know Hold 'Em, you know there is one more card to come. The host does not want anyone to share the door prize, so he must make sure that everyone at the table can still win the entire prize (no ties). But he also wants to make sure that there is at least one card left in the deck that will give each person a winner (the remaining cards are randomly shuffled to ensure a fair outcome).<br />
<br />
1. Prove the maximum possible value for N. (remember, everyone is drawing to win the entire prize and there is at least one card left that will give them the win). Hint-- N is greater than the normal 9 or 10 players in a typical Hold 'Em game.<br />
<br />
2. Solve for N (there are a few solutions). The solution must include the hands dealt to each person, the four cards in the middle, and the remaining cards left in the deck, and which hand will win with which card/s.<br />
<br />
This scenario actually came up at a dinner party I was invited to this summer. Ten of us were "dealt" in and with one more card to come, 9 of us were drawing to a win. We thought the host did a nice job with this little game, but wondered what the max N would be. It turns out there is a max N and there is a solution. Enjoy.]]></description>
		<pubDate>Wed, 18 Nov 2009 10:15:35 +0000</pubDate>
		<guid>http://brainden.com/forum/index.php?/topic/10692-interesting-poker-puzzle-if-you-like-poker/</guid>
	</item>
	<item>
		<title>... --- ...!</title>
		<link>http://brainden.com/forum/index.php?/topic/10689--/</link>
		<description><![CDATA[-.. .- ... .    -..  ---  -  -.. .- ... .  -.. .- ... .   <br />
-.. .- ... .  -.. .- ... . -.. .- ... . <br />
-.. .- ... .-..  ---   - -..  ---   - -.. .- ... . ! crack this one and I'll tell you how good a coconut you've got.]]></description>
		<pubDate>Tue, 17 Nov 2009 23:12:59 +0000</pubDate>
		<guid>http://brainden.com/forum/index.php?/topic/10689--/</guid>
	</item>
	<item>
		<title>Triplets and Minimum Query Puzzle</title>
		<link>http://brainden.com/forum/index.php?/topic/10686-triplets-and-minimum-query-puzzle/</link>
		<description><![CDATA[There are three identical triplets, Adam, Alan and Alex. It is known that precisely one of them is a truthteller, exactly one of them is a liar and the remaining triad member is an alternator, that is, he alternates true statements and false statements<br />
<br />
Frank, who is a mutual acquaintance of the three brothers is currently looking for Adam. He chances upon two of the triplets.  Unfortunately, since the brothers look exactly the same he is unable to distinguish between them.<br />
<br />
What is the minimum number of  questions Frank must ask the duo to guarentee that he can determine which triplet (either one of the two, or the one who's not there) is Adam?]]></description>
		<pubDate>Tue, 17 Nov 2009 16:55:38 +0000</pubDate>
		<guid>http://brainden.com/forum/index.php?/topic/10686-triplets-and-minimum-query-puzzle/</guid>
	</item>
	<item>
		<title>Monthly multiplication and prime puzzle</title>
		<link>http://brainden.com/forum/index.php?/topic/10685-monthly-multiplication-and-prime-puzzle/</link>
		<description><![CDATA[Solve the following alphametic multiplication puzzle, where each of the capital letters denotes a different base ten digit from 0 to 9. However, each asterisk represents a base ten digit from 0 to 9, whether same or different. None of the numbers can contain any leading zero.<br />
<br />
<pre class='prettyprint'>       * * * * * *       
               * *                   
      -------------                  
       * * * * * *                    
     * * * * * *                       
    ---------------                    
     O C T O B R E                
                                          
                                          

where each of OCTO, CTO, CTOB, TO, TOBR, TOBRE, OBRE,  BRE, 
BR,  RE and E is a prime number.</pre>]]></description>
		<pubDate>Tue, 17 Nov 2009 16:39:39 +0000</pubDate>
		<guid>http://brainden.com/forum/index.php?/topic/10685-monthly-multiplication-and-prime-puzzle/</guid>
	</item>
	<item>
		<title>Street racing</title>
		<link>http://brainden.com/forum/index.php?/topic/10678-street-racing/</link>
		<description><![CDATA[I was sitting in my car by the side of a highway, when i saw a car coming from behind.<br />
I started my engine and only when the distance between that car and mine was 10x i started moving.<br />
Though that car was moving with a constant speed 10x/3 and i was accelerating uniformly, after i drove for a distance 10x,<br />
that car became exactly next to me.<br />
At that exact moment i decreased my acceleration to the half, and drove for a distance of 45x/4 and the distance separating us became 12.5M (41.01ft)<br />
<br />
Which of the following cars could i possibly be driving?<br />
<br />
<br />
- SEAT ALTEA TDI 2.0 DSG<br />
- FERRARI F50<br />
- TECHART PORSCHE CAYENNE TURBO<br />
- LOTUS EXIGE<br />
- Mercedes G55 AMG<br />
- Levent-Sisli Suzuki DL650 V-Strom<br />
<br />
Notes: <br />
- He's never in the front.<br />
- The movement is linear.<br />
<div class='bbc_spoiler'>
	<span>Spoiler</span> for hint <input type='button' class='bbc_spoiler_show' value='Show' />
	<div class='bbc_spoiler_wrapper'><div class='bbc_spoiler_content' style="display:none;"> Do some research abt the cars.</div></div>
</div>]]></description>
		<pubDate>Mon, 16 Nov 2009 12:56:24 +0000</pubDate>
		<guid>http://brainden.com/forum/index.php?/topic/10678-street-racing/</guid>
	</item>
	<item>
		<title>Greatest value of M</title>
		<link>http://brainden.com/forum/index.php?/topic/10669-greatest-value-of-m/</link>
		<description><![CDATA[I have chosen two different numbers greater than N but less than M. I tell their sum to Mr. S and their product to Ms. P. The following conversation ensues:<br />
Mr. S:   I cannot determine the two numbers.<br />
Ms. P:   I cannot determine the two numbers either.<br />
Mr. S:   I still cannot determine the two numbers.<br />
Ms. P:   Now I can determine the two numbers.<br />
Mr. S:   Now I can determine the two numbers also.<br />
       Find the greatest value of M for which this puzzle has a unique solution, for N=1, N=2 and N=3.]]></description>
		<pubDate>Sat, 14 Nov 2009 15:08:39 +0000</pubDate>
		<guid>http://brainden.com/forum/index.php?/topic/10669-greatest-value-of-m/</guid>
	</item>
	<item>
		<title>Find value of x, y ,z</title>
		<link>http://brainden.com/forum/index.php?/topic/10668-find-value-of-x-y-z/</link>
		<description><![CDATA[If x, y, z all are positive integers... then <br />
<br />
31x^3 - y^3 = z^3.<br />
<br />
Now, if you consider non-positive integer solutions then..<br />
<br />
(0, -1, 1) and (42, -65, 137) are some of the solutions...<br />
<br />
 So, find out positive solutions only]]></description>
		<pubDate>Sat, 14 Nov 2009 14:24:18 +0000</pubDate>
		<guid>http://brainden.com/forum/index.php?/topic/10668-find-value-of-x-y-z/</guid>
	</item>
	<item>
		<title>Please Help</title>
		<link>http://brainden.com/forum/index.php?/topic/10667-please-help/</link>
		<description><![CDATA[I always have difficulty with logic puzzles. Usually, I miss making inferences that really make the puzzle's solution flow out. Are there any good books/resources that train people on logic puzzles? (I moved this from the brain teaser forum)<br />
<br />
The kind of puzzle I'm talking about would go something like this:<br />
<br />
Five bidders at an auction are hoping to secure a particularly nice piece of china. From the information given, can you work out where each is standing in the room, his or her bid, and the covert method of signaling each uses to indicate their bid to the auctioneer?<br />
<br />
1. The initial bid of $200 was made by nodding, but not by the bidder in the middle of hte room.<br />
<br />
2. Mr. Lott raised it to $225, but not by raising his finger; the bid made by that means was lower than Mr. Gowing's.<br />
<br />
3. Mrs. Gavell didn't take the price to $250; the person standing on the right raised the bid to $275.<br />
<br />
4. Mrs. Nock touched her ear to register her bid, but it was lower than that of the person sitting in the front row.<br />
<br />
5. The bidder standing to the left signaled a bid by raising his or her programme slightly.<br />
<br />
6. Mr. Sayle was standing in the back of the auction room.<br />
<br />
Bidders: Mrs. Gavell, Mr. Gowing, Mr. Lott, Mrs. Nock, Mr. Sayle<br />
<br />
Signal Method: Nodding, raising finger, raising programme, Touching ear, winking<br />
<br />
Bid: 200, 225, 250, 275, 300<br />
<br />
Position: Front row, middle, standing at back, standing left, standing right<br />
<br />
All of the problems I'm referring to are of this format. It's not <em class='bbc'>just this particular</em> puzzle giving me trouble, it's all puzzles of this format. I tried using the grid that they give in the book, but that doesn't help. There has to be a way to learn to master these, right? Please help! Thanks.]]></description>
		<pubDate>Sat, 14 Nov 2009 05:22:22 +0000</pubDate>
		<guid>http://brainden.com/forum/index.php?/topic/10667-please-help/</guid>
	</item>
	<item>
		<title>A Twist on Decimal Code</title>
		<link>http://brainden.com/forum/index.php?/topic/10662-a-twist-on-decimal-code/</link>
		<description><![CDATA[I thought I'd put my twist on xamdam's decimal code.  Just decrypt the following:<br />
<br />
<pre class='prettyprint'>5.50 --- 15.75 --- 325.150 --- 69.92 --- 147.84 --- 95.38 --- 68.187 --- 150.45 --- 20.260 --- 54.36 --- 16.112 --- 182.70 --- 224.84</pre>]]></description>
		<pubDate>Fri, 13 Nov 2009 20:10:12 +0000</pubDate>
		<guid>http://brainden.com/forum/index.php?/topic/10662-a-twist-on-decimal-code/</guid>
	</item>
	<item>
		<title>Great families</title>
		<link>http://brainden.com/forum/index.php?/topic/10660-great-families/</link>
		<description><![CDATA[Three families make a remarkable discovery. The sum of the ages of their members are all the same, the sum of the squares of the ages of their members are all the same, and the sum of the cubes of the ages of their members are all the same. Everyone in all 3 families has a different age, and nobody is more than 100 years old. <br />
<br />
       What is the smallest possible sum of their ages? Can this be done with 4 families?]]></description>
		<pubDate>Fri, 13 Nov 2009 06:35:35 +0000</pubDate>
		<guid>http://brainden.com/forum/index.php?/topic/10660-great-families/</guid>
	</item>
	<item>
		<title>Where did all the people go George?</title>
		<link>http://brainden.com/forum/index.php?/topic/10649-where-did-all-the-people-go-george/</link>
		<description><![CDATA[I hope no one has posted anything like this before... so here it goes....<br />
<br />
A bus full of people is traveling over a bridge on its way to Las Vagas. No one gets on or off, but, when the bus arrives in Las Vagas there's not a single person on board. How can this be possible??????????]]></description>
		<pubDate>Thu, 12 Nov 2009 01:55:21 +0000</pubDate>
		<guid>http://brainden.com/forum/index.php?/topic/10649-where-did-all-the-people-go-george/</guid>
	</item>
	<item>
		<title>Four individuals and liar identification puzzle</title>
		<link>http://brainden.com/forum/index.php?/topic/10647-four-individuals-and-liar-identification-puzzle/</link>
		<description><![CDATA[Each of the four persons P, Q, R and S are thinking of the same number. When a passersby asked what number they are thinking of, the four individuals respond as follows:<br />
<br />
&#149;	P: The number has two digits. <br />
&#149;	Q: The number is a divisor of 150. <br />
&#149;	R: The number is not 150. <br />
&#149;	S: The number is divisible by 25. <br />
<br />
However, precisely one of these individuals is a liar, while the remaining three are truthtellers.<br />
<br />
Identify the liar from the abovementioned statements.]]></description>
		<pubDate>Wed, 11 Nov 2009 17:23:13 +0000</pubDate>
		<guid>http://brainden.com/forum/index.php?/topic/10647-four-individuals-and-liar-identification-puzzle/</guid>
	</item>
	<item>
		<title>Factorial vs Exponential</title>
		<link>http://brainden.com/forum/index.php?/topic/10644-factorial-vs-exponential/</link>
		<description><![CDATA[Which has the greater value<br />
<br />
101<sup class='bbc'>200</sup> or 101*(200!) ?]]></description>
		<pubDate>Wed, 11 Nov 2009 10:57:54 +0000</pubDate>
		<guid>http://brainden.com/forum/index.php?/topic/10644-factorial-vs-exponential/</guid>
	</item>
	<item>
		<title>Duodecimal positive integer, divisibility and 26th digit puzzle</title>
		<link>http://brainden.com/forum/index.php?/topic/10643-duodecimal-positive-integer-divisibility-and-26th-digit-puzzle/</link>
		<description><![CDATA[N is a 50-digit duodecimal (base 12) positive integer. All the digits of N is 1 except the 26th digit (reading left to right).<br />
<br />
Reading left to right, what is the 26th digit of N, given that the duodecimal number 17 divides N?]]></description>
		<pubDate>Wed, 11 Nov 2009 08:41:05 +0000</pubDate>
		<guid>http://brainden.com/forum/index.php?/topic/10643-duodecimal-positive-integer-divisibility-and-26th-digit-puzzle/</guid>
	</item>
	<item>
		<title>A Moving Problem</title>
		<link>http://brainden.com/forum/index.php?/topic/10632-a-moving-problem/</link>
		<description><![CDATA[A ribbon comprises a line of squares numbered sequentially from 0 to <em class='bbc'>n</em>.  A marker can initially be placed on any square.  After positioning such a marker, it may be repositioned by moving it <em class='bbc'>p</em> squares to the right or <em class='bbc'>q</em> squares to the left, provided that one does not fall off the ribbon.  The numbers <em class='bbc'>p</em> and <em class='bbc'>q</em> are mutually co-prime.<br />
<br />
Show that <em class='bbc'>n</em> = <em class='bbc'>p</em> + <em class='bbc'>q</em>  2  is the smallest value for <em class='bbc'>n</em> which permits all squares to be visited after a successive number of moves.]]></description>
		<pubDate>Tue, 10 Nov 2009 11:29:10 +0000</pubDate>
		<guid>http://brainden.com/forum/index.php?/topic/10632-a-moving-problem/</guid>
	</item>
	<item>
		<title><![CDATA[game&#38;strategy]]></title>
		<link>http://brainden.com/forum/index.php?/topic/10631-gamestrategy/</link>
		<description><![CDATA[you are playing a game with your friend on a 7x7 chess board.<br />
you begin first and put a "0"(zero) on any square on the board, then your friend puts a "1"(one);<br />
next you put zero, then your firend puts one...<br />
game is going on so until all squares are marked with zero's and one's.<br />
afterthat sum of the numbers in each row and column are notted;<br />
<br />
i)odd numbers of those summed numbers go to you,<br />
ii)even numbers of them go to your friend,<br />
<br />
you and your friend add your numbers,the one whose collected number is higher than the others wins the game.<br />
<br />
Question: <br />
<br />
assuming that you and your friend play the game without any mistake/fault(i.e. both are expert on this game), <br />
what can be the maximum number that you can get?]]></description>
		<pubDate>Tue, 10 Nov 2009 07:51:36 +0000</pubDate>
		<guid>http://brainden.com/forum/index.php?/topic/10631-gamestrategy/</guid>
	</item>
	<item>
		<title>New Genetics Problems</title>
		<link>http://brainden.com/forum/index.php?/topic/10627-new-genetics-problems/</link>
		<description><![CDATA[There is an effect that only shows when someone is homozygous recessive for the trait. This phenotype shows in one certain female, who has a child with a male who does NOT show the trait. not all females get this effect, and males can also get it too. The couple has a child that shows the effect [which is being homozygous recessive]. They have another child who also shows the effect. Then they have a THIRD child who shows the effect. <br />
<br />
What WAS the probability before it was born that the first child would show the recessive phenotype?<br />
What WAS the probability before IT was born that the second child would show the phenotype? <br />
What WAS the probability before IT was born that the third child would show the phenotype? <br />
<br />
This is the answer...<br />
<div class='bbc_spoiler'>
	<span>Spoiler</span> for My Answer <input type='button' class='bbc_spoiler_show' value='Show' />
	<div class='bbc_spoiler_wrapper'><div class='bbc_spoiler_content' style="display:none;">The male must have at least one dominant gene because he does not show the effect that the female does. The Female is completely recessive. Crossing these genotypes:<br />
<br />
RR x rr / Rr x rr<br />
<br />
RR x rr gives us ALL CHILDREN BEING Rr, not showing the trait. So, this means that if the father is RR, the probability of having a recessive child is 0%. However, if the father was Rr, then there is a chance of 50% to be recessive, and 50% to be Heterozygous: a 2:4 ratio. There are 8 possibilities for the joining of genes, 4 from the RR situation and 4 from the Rr situation. There are only 2 ways the child can be recessive completely, and out of 8 ways total, that's a 1/4 chance, or 25%. <br />
<br />
For the next children, it is different. Now, because we know the first child showed the recessive phenotype, we know the father is Rr, because if he was RR, then NONE of the children would show the trait. The cross now looks like this:<br />
<br />
Rr x rr ONLY!<br />
<br />
there's a 50% chance for recessive, 50% chance heterozygous. There is a 50% chance the second child will show the trait.<br />
<br />
THE SAME IS FOR THE THIRD CHILD. 50%.<br />
1: 25% chance - 2: 50% chance - 3: 50% chance. <br />
</div></div>
</div>]]></description>
		<pubDate>Mon, 09 Nov 2009 22:18:08 +0000</pubDate>
		<guid>http://brainden.com/forum/index.php?/topic/10627-new-genetics-problems/</guid>
	</item>
	<item>
		<title>Two Urns and Two Colored Balls Puzzle</title>
		<link>http://brainden.com/forum/index.php?/topic/10623-two-urns-and-two-colored-balls-puzzle/</link>
		<description><![CDATA[From urn A containing 4 white and 8 black balls, 6 balls are transferred into an empty urn B. Three balls are now drawn from urn B, and each of them happens to be white. <br />
<br />
Determine the probability that a fourth ball drawn from urn B will be white, if:<br />
<br />
(I) The first three balls are returned to urn B.<br />
<br />
(II)  None of the first three balls are returned to urn B.]]></description>
		<pubDate>Mon, 09 Nov 2009 18:51:08 +0000</pubDate>
		<guid>http://brainden.com/forum/index.php?/topic/10623-two-urns-and-two-colored-balls-puzzle/</guid>
	</item>
	<item>
		<title>Powers, Six digit Numbers and Substitution Puzzle</title>
		<link>http://brainden.com/forum/index.php?/topic/10622-powers-six-digit-numbers-and-substitution-puzzle/</link>
		<description><![CDATA[Substitute each of the capital letters by a different base ten digit from 1 to 9, to satisfy this set of <a href='http://en.wikipedia.org/wiki/Verbal_arithmetic' class='bbc_url' title='External link'><strong class='bbc'>cryptarithmetic</strong></a> equations. Each of F, G, H and I represents an odd digit.<br />
<br />
GBIGBE = (EDB)<sup class='bbc'>D</sup>, and:<br />
<br />
ADBADF = (HDH)<sup class='bbc'>D</sup>, and:<br />
<br />
HGAHGC = (BEC)<sup class='bbc'>D</sup>]]></description>
		<pubDate>Mon, 09 Nov 2009 18:44:27 +0000</pubDate>
		<guid>http://brainden.com/forum/index.php?/topic/10622-powers-six-digit-numbers-and-substitution-puzzle/</guid>
	</item>
	<item>
		<title>Spheres in a cone</title>
		<link>http://brainden.com/forum/index.php?/topic/10614-spheres-in-a-cone/</link>
		<description><![CDATA[An infinite amount of spheres are placed in a cone with a half angle x (0&lt;x&lt;90) as in the diagram below. Find the ratio: <br />
<br />
(total volume of spheres) / (volume of cone)<br />
<br />
<img src="http://brainden.com/forum/uploads/post-16511-12576836207818.jpg" class='bbc_img linked-image' alt="" /><br />
<br />
I hope this one last more than 30 minutes this time.]]></description>
		<pubDate>Sun, 08 Nov 2009 12:41:58 +0000</pubDate>
		<guid>http://brainden.com/forum/index.php?/topic/10614-spheres-in-a-cone/</guid>
	</item>
	<item>
		<title>Bad Poll</title>
		<link>http://brainden.com/forum/index.php?/topic/10613-bad-poll/</link>
		<description><![CDATA[Today I came across a website that has a daily poll. Today the question was <br />
<br />
'How often do you visit this site?' <br />
1. About once a day (75%)<br />
2. About once a week (20%)<br />
3. About once a month (4%)<br />
4. About once a year (1%)<br />
<br />
I have simplified the options and results for the purpose of this puzzle. Assume that everyone can fit into one of the four categories. However, it should hopefully be obvious to a statistician (probably no so much to the people who posted the poll) that the results are not representative. <br />
<br />
Can you adjust the results of this poll to give more representative data?]]></description>
		<pubDate>Sun, 08 Nov 2009 10:24:11 +0000</pubDate>
		<guid>http://brainden.com/forum/index.php?/topic/10613-bad-poll/</guid>
	</item>
	<item>
		<title>square-free</title>
		<link>http://brainden.com/forum/index.php?/topic/10612-square-free/</link>
		<description><![CDATA[the classic square free sequence (a sequence of digits such that no adjacent sequence of any length is the same) is fairly widely known.<br />
<br />
0<br />
12<br />
1020<br />
10212012<br />
...<br />
the next line is generated by 3 substitution rules,<br />
0 -&gt; 12<br />
1 -&gt; 102<br />
2 -&gt; 0<br />
you might note that the length of the sequence always is a power of 2.<br />
<br />
now for the puzzle:<br />
can you create substitution rules for 0,1,2,3 such that the sequence is square free and length of the sequence is powers of 3?]]></description>
		<pubDate>Sun, 08 Nov 2009 03:08:40 +0000</pubDate>
		<guid>http://brainden.com/forum/index.php?/topic/10612-square-free/</guid>
	</item>
	<item>
		<title>Acid and two representations puzzle</title>
		<link>http://brainden.com/forum/index.php?/topic/10611-acid-and-two-representations-puzzle/</link>
		<description><![CDATA[Substitute each of the letters by a different base ten digit from 1 to 9 to satisfy the following <a href='http://en.wikipedia.org/wiki/Verbal_arithmetic' class='bbc_url' title='External link'><strong class='bbc'>alphametic</strong></a> equation.<br />
<br />
ACID = B<sup class='bbc'>F</sup> + E<sup class='bbc'>F</sup> + G<sup class='bbc'>F</sup> = H<sup class='bbc'>F</sup> + I<sup class='bbc'>F</sup> + D<sup class='bbc'>F</sup>]]></description>
		<pubDate>Sun, 08 Nov 2009 02:11:17 +0000</pubDate>
		<guid>http://brainden.com/forum/index.php?/topic/10611-acid-and-two-representations-puzzle/</guid>
	</item>
	<item>
		<title>Eight Digit Number and Summed Power Puzzle</title>
		<link>http://brainden.com/forum/index.php?/topic/10610-eight-digit-number-and-summed-power-puzzle/</link>
		<description><![CDATA[Substitute each of the capital letters by a different base ten digit from 0 to 8 to satisfy each of the following <a href='http://en.wikipedia.org/wiki/Verbal_arithmetic' class='bbc_url' title='External link'><strong class='bbc'>cryptarithmetic</strong></a> relationships.<br />
<br />
(I)	ABCDEFGF = A<sup class='bbc'>E</sup> + B<sup class='bbc'>E</sup>+ C<sup class='bbc'>E</sup>+ D<sup class='bbc'>E</sup>+ E<sup class='bbc'>E</sup>+ F<sup class='bbc'>E</sup>+ G<sup class='bbc'>E</sup>+ F<sup class='bbc'>E</sup><br />
where, each of A and E is nonzero, and:<br />
<br />
(II)	ABCDEFGF does not contain the digit 1, and:<br />
<br />
(III)	Reading from left to right, nonzero even digits appear in ascending order of magnitude, but odd digits appear in descending order of magnitude in ABCDEFGF.]]></description>
		<pubDate>Sun, 08 Nov 2009 01:51:23 +0000</pubDate>
		<guid>http://brainden.com/forum/index.php?/topic/10610-eight-digit-number-and-summed-power-puzzle/</guid>
	</item>
	<item>
		<title>Fiftieth Derivative Puzzle</title>
		<link>http://brainden.com/forum/index.php?/topic/10609-fiftieth-derivative-puzzle/</link>
		<description><![CDATA[Let f(x) = (x+1)<sup class='bbc'>2</sup>*e<sup class='bbc'>2x</sup>. <br />
<br />
The fiftieth derivative f <sup class='bbc'>(50)</sup>(0) can be expressed in the form k*2<sup class='bbc'>n</sup> where k is an odd integer and n is a positive integer. <br />
<br />
Find k and n.]]></description>
		<pubDate>Sun, 08 Nov 2009 01:43:41 +0000</pubDate>
		<guid>http://brainden.com/forum/index.php?/topic/10609-fiftieth-derivative-puzzle/</guid>
	</item>
	<item>
		<title>and finally!</title>
		<link>http://brainden.com/forum/index.php?/topic/10607-and-finally/</link>
		<description><![CDATA[Can you write a sentence that is perfectly logical, meaningful and correct that has the word "and" repeated five times in a row?]]></description>
		<pubDate>Sat, 07 Nov 2009 23:48:02 +0000</pubDate>
		<guid>http://brainden.com/forum/index.php?/topic/10607-and-finally/</guid>
	</item>
	<item>
		<title>The Decimal Code</title>
		<link>http://brainden.com/forum/index.php?/topic/10605-the-decimal-code/</link>
		<description><![CDATA[<span style='color: #0000FF'>42.63 ---  19.95 --- 10.75 --- 5.5 --- 66.88  ---  35.15 ---   54.72 ---   50.75 ---   46.92 ---   40.8 ---   63.99 ---   90.18 ---   4.72 ---   24.36 ---   31.62 ---   46.46 ---   72.72 --- 25.45 --- 36.54  													<br />
<br />
						<br />
<span style='font-size: 17px;'>ENDDROOPACORNTHINKERSMANANDNOTYOUMORENOTSPIDERLOW</span></span>]]></description>
		<pubDate>Sat, 07 Nov 2009 21:51:59 +0000</pubDate>
		<guid>http://brainden.com/forum/index.php?/topic/10605-the-decimal-code/</guid>
	</item>
	<item>
		<title>How many factors?</title>
		<link>http://brainden.com/forum/index.php?/topic/10604-how-many-factors/</link>
		<description><![CDATA[X is the product of p prime numbers. None of the factors of X are square (except 1). How many factors does X<sup class='bbc'>n</sup> have?]]></description>
		<pubDate>Sat, 07 Nov 2009 14:08:08 +0000</pubDate>
		<guid>http://brainden.com/forum/index.php?/topic/10604-how-many-factors/</guid>
	</item>
</channel>
</rss>