Search All of the Math Forum:
Views expressed in these public forums are not endorsed by
NCTM or The Math Forum.



Re: Formal proof of the ambiguity of 0^0
Posted:
Nov 17, 2013 5:05 PM


On Sunday, November 17, 2013 3:43:10 PM UTC5, Julio Di Egidio wrote: > "Dan Christensen" <Dan_Christensen@sympatico.ca> wrote in message > > news:4856f63d162941988d16fa71c5365bcd@googlegroups.com... > > > > > 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.
Dan Download my DC Proof 2.0 software at http://www.dcproof.com Visit my new math blog at http://www.dcproof.wordpress.com



