Re: Proof...
From: Dave Seaman (dseaman_at_no.such.host)
Date: 02/08/05
- Next message: Chairman of the David Hilbert Appreciation Society: "Re: Proof..."
- Previous message: matt271829-news_at_yahoo.co.uk: "Re: queen of the science"
- In reply to: jim caprioli: "Proof..."
- Next in thread: jim caprioli: "Re: Proof..."
- Reply: jim caprioli: "Re: Proof..."
- Reply: Bill Smythe: "Re: Proof..."
- Messages sorted by: [ date ] [ thread ]
Date: Tue, 8 Feb 2005 23:13:42 +0000 (UTC)
On Wed, 09 Feb 2005 00:09:10 +0100, jim caprioli wrote:
> Let n be a positive integer > 2.
> Repeat until n is 1.
> if n is odd then subtract 1 from n
> if n is even then divide n by 2
> What is the mathematical proof that this algorithm stops??
Suppose it doesn't. Let N be the smallest integer > 2 such that the
algorithm fails to halt. What can you say about the number you get after
one iteration?
-- Dave Seaman Judge Yohn's mistakes revealed in Mumia Abu-Jamal ruling. <http://www.commoncouragepress.com/index.cfm?action=book&bookid=228>
- Next message: Chairman of the David Hilbert Appreciation Society: "Re: Proof..."
- Previous message: matt271829-news_at_yahoo.co.uk: "Re: queen of the science"
- In reply to: jim caprioli: "Proof..."
- Next in thread: jim caprioli: "Re: Proof..."
- Reply: jim caprioli: "Re: Proof..."
- Reply: Bill Smythe: "Re: Proof..."
- Messages sorted by: [ date ] [ thread ]
Relevant Pages
|
