AoPSWiki
Want to learn how to tackle those tough AMC/AIME/Olympiad counting and probability problems? Check out Art of Problem Solving's Intermediate Counting & Probability by David Patrick.

Talk:Trivial Inequality

From AoPSWiki

Revision as of 22:17, 15 March 2008 by Temperal (Talk | contribs)
(diff) ← Older revision | Current revision (diff) | Newer revision → (diff)

I'm just wondering if the proof presented is 'rigorous'... I'll need a 3rd reader to confirm this.--10000th User 16:47, 22 November 2007 (EST)

I think it is most certainly rigorous.--1=2 9:08, 23 November 2007 (EST)

There is a constructive proof presented in Rudin's book Principles of Mathematical Analysis that does not use the method of contradiction. But, the proof itself is quite lengthy and depends on several basic propositions derived from the field axioms. Anyways, thank you so much 1=2.--10000th User 11:58, 23 November 2007 (EST)

Try our innovative online adaptive learning system, Alcumus.
Over 1100 problems and 60+ video lessons. FREE!
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us