Archive for Follow Up

Morris: World of Britain 2: Proof and Paradox

paradox-clockIn working out the proof for World of Britain I came across a paradox.  Maybe smarter Math Factorites can help me out?  My sanity could depend on it.

In the puzzle you have five different tasks.  On each day one of these tasks is given at random.  How long do you expect it to take to get all five tasks?

First consider a simple case.  Suppose some event has a probability, p, of happening on any one day.  Let’s say that E(p) is the expected number of days we have to wait for the event to happen.  For example if p=1 then the event is guaranteed to happen every day and so E(p)=1.

How can we calculate E(p)? 

Read the rest of this entry »

Comments (5)

Yoak: Followup to A Rather Odd Car Trip

This is a followup to my earlier post, A Rather Odd Car Trip.  It provides a solution so if you haven’t read that yet, you should do so first as this won’t make much sense without it.

Show Spoiler ▼

Comments

Morris: Turning Tables

tt23I took one of Peter Winkler’s puzzle books on holiday recently.  After dinner each night I intended to impress my friend with an amazing math puzzle.  I had done this before.

The book dissapeared on the flight out.  After dinner each night my friend impressed me with an amazing math puzzle.  I haven’t seen the book since.

Serves me right!

 

This is one of those puzzles, you will understand why I have to do it from memory.

 

I really like Jeff’s post  A Fun Trick – Guess the Polynomial.  You might want to look at it first.

If you relax the conditions a bit you have a similar sounding puzzle with a very different solution.

So my puzzle is this:

I am thinking of a polynomial.  All of the co-efficients are fractions.   You may use any number as your test number.  When you give me a test number I will tell you the result.

How many test numbers do you need to identify the polynomial?

Comments (2)

Follow Up: Sequences of Averages

In response to the post “Stacking Cannonballs” Trevor H. writes:

 I was very intrigued by the recursive sequence you mentioned in the past two episodes–the sequence that begins with 1 and each successive term is the average of all the previous terms times some constant. I have always been fascinated by Pascal’s triangle and all of its surprise appearances in mathematics. Also, my fist encounter with doing mathematics for fun out of my own curiosity was to find a formula for triangle numbers. Like Kyle, I was inspired by bowling pin arrangements. The experience was very rewarding and I have been in love with mathematics ever since.

Read the rest of this entry »

Comments

Follow Up: Differences

Given a difference table, as we considered back in EV. What’s the Difference , how do we come up with a polynomial that gives the values on the top row?

For example, suppose we have

-1     -1     3     35     143     399     899 . . . . .
      0     4     32    108     256     500  . . . . .
         4    28    76     148      244  . . . . .
             24    48     72       96   . . . . .
                  24     24    24    . . . . .

What is the polynomial P(n), of degree four, that gives

P(0) = -1 P(1) = -1 P(2) = 3 P(3) = 35 P(4) = 143 , etc.

Can this be expressed simply in terms of the leading values on the left of the table: -1, 0, 4, 24, 24?

Read the rest of this entry »

Comments (2)

Follow Up: The Harmonic Series

That the worm falls off the end of the rope depends on the fact that the incredible
harmonic series

1 + 1/2 + 1/3 + 1/4 + . . .
diverges to infinity, growing as large as you please!

Read the rest of this entry »

Comments (2)

Follow Up: The Busy Beaver Function

Why can there be no computable bound to the Busy Beaver Function?

Read the rest of this entry »

Comments

Follow Up: Smullyan’s Paradoxes!

We present a recording of Raymond Smullyan’s lecture at the Gathering for Gardner, March 30, 2008; Newcomb’s paradox really is a stumper.

 
icon for podpress  Standard Podcast [13:50m]: Play Now | Play in Popup | Download

Comments

Follow Up: Prime Dice

We also asked, on this week’s segment how to label the faces of some ordinary dice, with twelve different numbers (we did say different didn’t we?) so that every roll produces a prime number. This puzzle is from the fascinating site www.primepuzzles.net. Don’t peek!

Comments (4)

Follow Up: Escaping the Beast

We can say a bit more about the Princess’s escape.

Amazingly, an optimal path for the Princess is to swim in a half circle of radius 1/8 that of the lake, then dash out to the edge.
We’ll give an analytic proof, but we could give a totally synthetic (geometric) proof as well.

Read the rest of this entry »

Comments (2)