<![CDATA[Math Is Fun Forum / "Dropping Balls" Puzzle]]> 2012-10-22T16:41:23Z FluxBB https://www.mathisfunforum.com/viewtopic.php?id=15613 <![CDATA[Re: "Dropping Balls" Puzzle]]> Hi vikramhegde;

vikramhegde wrote:

We will find that 19 is the least number of tries required.

Have you gone to 10000 floors? I am getting 33 for that.

]]>
https://www.mathisfunforum.com/profile.php?id=33790 2012-10-22T16:41:23Z https://www.mathisfunforum.com/viewtopic.php?pid=236666#p236666
<![CDATA[Re: "Dropping Balls" Puzzle]]> vikramhegde wrote:

Ok so the procedure is like this.
First consider a triangular number sequence [ fn = (n+1).n/2] for n = 1,2,3..
The 18th number on this sequence is 171.
And sum of all triangular numbers till 171 (the tetrahedral number) crosses 1000
Now, for each subsequent drop of the first ball (when it doesn't break) we add the previous number on the triangular sequence.
So ball number one is dropped for the first time from Floor number 171, second at (171+153)=324, third at (324+136)=460, fourth at (460+120)=580, fifth at (580+105)=685, sixth at (685+91)=776, seventh at 854, eighth at 920, ninth 975, tenth at 999. Let us call these numbers M#1, M#2, M#3....

Now, if it breaks in the first try at 171, we start dropping the ball at floor numbers 18, 18+17, 18+17+16,
Similarly for any break of the first ball on floor M#x, the floor number at which we drop the second ball is given by -
{(M#x-1)+P} and if the second ball doesn't break at this, we continue on the sequence - {(M#x-1)+P+(P-1)}, {(M#x-1)+P+(P-2)},  {(M#x-1)+P+(P-3)}... {(M#x-1)+P+(P-P)} Where P is the position of {M#x - (M#x-1)} on the triangular sequence.

Having broken the second ball somewhere, we go back to the last try where we didn't break it and work our way up with tries on each floor till it breaks.

We will find that 19 is the least number of tries required.

I'm sorry I'm not trained in mathematics and hence have to put it in such a round about manner. I'm not so familiar with the notation and the use of sigma functions and had to invent some notation of my own. I hope I've explained it adequately.

Also, I'd be happy if someone could explain it a more simple manner.

just to correct you on that it should be M#x-1 + p + 1 to see why imangine dropping the first ball from 172. You can still do it even if it breaks on that floor other that your solution is spot on:D

]]>
https://www.mathisfunforum.com/profile.php?id=38240 2012-10-06T18:39:28Z https://www.mathisfunforum.com/viewtopic.php?pid=234455#p234455
<![CDATA[Re: "Dropping Balls" Puzzle]]> hi vikramhegde

Thanks for the method.  Inventing notation is perfectly acceptable as long as you define your terms (as you have).  And you have arrived at the OP's answer!  So it would seem you are more of a mathematician than you think!  Lot's of us here are 'self-taught'; I could argue the case that makes you a better mathematician!

Welcome to the forum! Bob

]]>
https://www.mathisfunforum.com/profile.php?id=67694 2012-10-01T06:55:13Z https://www.mathisfunforum.com/viewtopic.php?pid=233744#p233744
<![CDATA[Re: "Dropping Balls" Puzzle]]> Ok so the procedure is like this.
First consider a triangular number sequence [ fn = (n+1).n/2] for n = 1,2,3..
The 18th number on this sequence is 171.
And sum of all triangular numbers till 171 (the tetrahedral number) crosses 1000
Now, for each subsequent drop of the first ball (when it doesn't break) we add the previous number on the triangular sequence.
So ball number one is dropped for the first time from Floor number 171, second at (171+153)=324, third at (324+136)=460, fourth at (460+120)=580, fifth at (580+105)=685, sixth at (685+91)=776, seventh at 854, eighth at 920, ninth 975, tenth at 999. Let us call these numbers M#1, M#2, M#3....

Now, if it breaks in the first try at 171, we start dropping the ball at floor numbers 18, 18+17, 18+17+16,
Similarly for any break of the first ball on floor M#x, the floor number at which we drop the second ball is given by -
{(M#x-1)+P} and if the second ball doesn't break at this, we continue on the sequence - {(M#x-1)+P+(P-1)}, {(M#x-1)+P+(P-2)},  {(M#x-1)+P+(P-3)}... {(M#x-1)+P+(P-P)} Where P is the position of {M#x - (M#x-1)} on the triangular sequence.

Having broken the second ball somewhere, we go back to the last try where we didn't break it and work our way up with tries on each floor till it breaks.

We will find that 19 is the least number of tries required.

I'm sorry I'm not trained in mathematics and hence have to put it in such a round about manner. I'm not so familiar with the notation and the use of sigma functions and had to invent some notation of my own. I hope I've explained it adequately.

Also, I'd be happy if someone could explain it a more simple manner.

]]>
https://www.mathisfunforum.com/profile.php?id=194595 2012-10-01T05:11:15Z https://www.mathisfunforum.com/viewtopic.php?pid=233740#p233740
<![CDATA[Re: "Dropping Balls" Puzzle]]> In case of "Droppng Balls Puzzle", the minimum no. of cases of dropping balls should be 12 if it doesn't break until 99th floor......
Wat u say ?????.

]]>
https://www.mathisfunforum.com/profile.php?id=180826 2012-01-15T07:33:08Z https://www.mathisfunforum.com/viewtopic.php?pid=198610#p198610
<![CDATA[Re: "Dropping Balls" Puzzle]]>

I still need a procedure but that's the answer:D

]]>
https://www.mathisfunforum.com/profile.php?id=38240 2011-11-12T16:43:31Z https://www.mathisfunforum.com/viewtopic.php?pid=194814#p194814
<![CDATA[Re: "Dropping Balls" Puzzle]]> ZHero wrote:

"What is the maximum number of times you have to drop the snooker balls....

Good point. Changed it to "least". Thanks.

]]>
https://www.mathisfunforum.com/profile.php?id=2 2011-06-07T03:10:05Z https://www.mathisfunforum.com/viewtopic.php?pid=176401#p176401
<![CDATA[Re: "Dropping Balls" Puzzle]]> hi ws

]]>
https://www.mathisfunforum.com/profile.php?id=118786 2011-06-06T22:01:07Z https://www.mathisfunforum.com/viewtopic.php?pid=176399#p176399
<![CDATA[Re: "Dropping Balls" Puzzle]]> Hi wintersolstice,

]]>
https://www.mathisfunforum.com/profile.php?id=91222 2011-06-06T17:27:19Z https://www.mathisfunforum.com/viewtopic.php?pid=176391#p176391
<![CDATA[Re: "Dropping Balls" Puzzle]]> gAr wrote:

Hi wintersolstice,

no but very close:D

]]>
https://www.mathisfunforum.com/profile.php?id=38240 2011-06-06T15:33:02Z https://www.mathisfunforum.com/viewtopic.php?pid=176381#p176381
<![CDATA[Re: "Dropping Balls" Puzzle]]> Hi wintersolstice,

]]>
https://www.mathisfunforum.com/profile.php?id=91222 2011-06-06T13:54:26Z https://www.mathisfunforum.com/viewtopic.php?pid=176368#p176368
<![CDATA[Re: "Dropping Balls" Puzzle]]> @MathsIsFun: The puzzle at MathIsFun reads "What is the maximum number of times you have to drop the snooker balls.....". Well, I guess, I can drop the balls a maximum of 100 times starting from 1st floor continuing upto 100th floor? ]]>
https://www.mathisfunforum.com/profile.php?id=12700 2011-06-06T11:23:37Z https://www.mathisfunforum.com/viewtopic.php?pid=176356#p176356
<![CDATA[Re: "Dropping Balls" Puzzle]]> I could add this to the puzzles if you wish.

]]>
https://www.mathisfunforum.com/profile.php?id=2 2011-06-06T05:45:33Z https://www.mathisfunforum.com/viewtopic.php?pid=176294#p176294
<![CDATA[Re: "Dropping Balls" Puzzle]]> No thats when you have 2 balls. With 3 you can do it in fewer!

]]>
https://www.mathisfunforum.com/profile.php?id=38240 2011-06-05T22:16:00Z https://www.mathisfunforum.com/viewtopic.php?pid=176283#p176283
<![CDATA[Re: "Dropping Balls" Puzzle]]> hi ws

]]>
https://www.mathisfunforum.com/profile.php?id=118786 2011-06-05T16:48:09Z https://www.mathisfunforum.com/viewtopic.php?pid=176228#p176228