[seqfan] Re: puzzle suitable to make a sequence ?
mathoflove-seqfan at yahoo.com
Tue May 11 01:24:07 CEST 2010
A002024 n appears n times.
It should be the inverse of triangular numbers.
--- On Mon, 5/10/10, Alexander P-sky <apovolot at gmail.com> wrote:
> From: Alexander P-sky <apovolot at gmail.com>
> Subject: [seqfan] puzzle suitable to make a sequence ?
> To: seqfan at list.seqfan.eu
> Date: Monday, May 10, 2010, 6:46 PM
> Here is the puzzle suitable IMHO to make a sequence ....
> Given are the "n" story building and two balls, which are
> made of some
> breakable material (say glass). The balls are such that
> they break
> being thrown down from the certain height (and above),
> while being
> thrown at lesser height, the ball remains to be in tact.
> What is the minimum number of throwing attempts "k" is
> needed to
> experimentally but systematically and successfully
> determine (for the
> the worst case scenario ) starting from which floor of the
> "n" story
> building (if from any) the ball will start to break
> while being
> thrown down. Again it is important to stress that only two
> balls are
> available for experimental testing and that obtaining the
> result is required.
> I am leaving to the audience (recipients of this list) to
> come up
> with the strategy of determining the minimum number of
> attempts "k" for given "n".
> Is k(n) sequence in OEIS ?
> Seqfan Mailing list - http://list.seqfan.eu/
More information about the SeqFan