The Math Forum

Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Math Forum » Discussions » sci.math.* » sci.math

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: Formal proof of the ambiguity of 0^0
Replies: 6   Last Post: Nov 17, 2013 5:05 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Dan Christensen

Posts: 8,219
Registered: 7/9/08
Re: Formal proof of the ambiguity of 0^0
Posted: Nov 17, 2013 5:05 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

On Sunday, November 17, 2013 3:43:10 PM UTC-5, Julio Di Egidio wrote:
> "Dan Christensen" <> wrote in message

> > Let's face it, you have more or less ruled out 0^0 being undefined. There
> > is no convincing you.
> Let's face it, there is just no reasoning with you.

It's easy. Just prove that for all binary functions ^ on N we have:

ALL(a):[a e N => [a=/=0 => a^0 = 1]
& ALL(a):ALL(b):[a e N & b e N => a^(b+1) = a^b * a]
<=> 0^0 = 1

I have already proven the contrary, but don't let that stop you.

Download my DC Proof 2.0 software at
Visit my new math blog at

Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© The Math Forum at NCTM 1994-2018. All Rights Reserved.