- --- Jon Perry <perry@...> wrote:
> at:

http://www.users.globalnet.co.uk/~perry/maths/eulerbyinduction/euler.htm

>

There's no induction there at all.

Induction is

From

Predicate(a_0)

Predicate(a_i) -> Predicate(a_(i+1)) (*)

Duduce

Predicate(a_i) for all i>=0

The starred statement is often called the inductive step.

If you wish to use induction then you should probably use

Predicate(x) is "Any number with x distinct prime factors..."

with a_0=1

Phil

__________________________________________________

Do You Yahoo!?

Yahoo! Tax Center - online filing with TurboTax

http://taxes.yahoo.com/ - updated at:

http://www.users.globalnet.co.uk/~perry/maths/simpleEuler/euler.htm

Jon Perry

perry@...

http://www.users.globalnet.co.uk/~perry/maths

BrainBench MVP for HTML and JavaScript

http://www.brainbench.com

-----Original Message-----

From: Phil Carmody [mailto:thefatphil@...]

Sent: 04 April 2002 12:16

To: primenumbers

Subject: Re: [PrimeNumbers] Euler By Induction

--- Jon Perry <perry@...> wrote:> at:

http://www.users.globalnet.co.uk/~perry/maths/eulerbyinduction/euler.htm

>

There's no induction there at all.

Induction is

From

Predicate(a_0)

Predicate(a_i) -> Predicate(a_(i+1)) (*)

Duduce

Predicate(a_i) for all i>=0

The starred statement is often called the inductive step.

If you wish to use induction then you should probably use

Predicate(x) is "Any number with x distinct prime factors..."

with a_0=1

Phil

__________________________________________________

Do You Yahoo!?

Yahoo! Tax Center - online filing with TurboTax

http://taxes.yahoo.com/

Unsubscribe by an email to: primenumbers-unsubscribe@egroups.com

The Prime Pages : http://www.primepages.org

Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/