Re: Proof...
From: Jon Haugsand (jonhaug_at_ifi.uio.no)
Date: 02/08/05
- Next message: matt271829-news_at_yahoo.co.uk: "Re: queen of the science"
- Previous message: agapito6314_at_aol.com: "Re: Existence of integer - proof"
- In reply to: jim caprioli: "Proof..."
- Next in thread: Dave Seaman: "Re: Proof..."
- Messages sorted by: [ date ] [ thread ]
Date: 09 Feb 2005 00:16:30 +0100
* jim caprioli
> 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??
Use either induction or that the positive integers is a well-founded
set.
-- Jon Haugsand Dept. of Informatics, Univ. of Oslo, Norway, mailto:jonhaug@ifi.uio.no http://www.ifi.uio.no/~jonhaug/, Phone: +47 22 85 24 92
- Next message: matt271829-news_at_yahoo.co.uk: "Re: queen of the science"
- Previous message: agapito6314_at_aol.com: "Re: Existence of integer - proof"
- In reply to: jim caprioli: "Proof..."
- Next in thread: Dave Seaman: "Re: Proof..."
- Messages sorted by: [ date ] [ thread ]
Relevant Pages
|
