Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Mathematical induction
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
=== Forward-backward induction === {{Main articles|Inequality of arithmetic and geometric means#Proof by Cauchy using forward–backward induction|l1 = Forward-backward induction}} Sometimes, it is more convenient to deduce backwards, proving the statement for <math>n-1</math>, given its validity for <math>n</math>. However, proving the validity of the statement for no single number suffices to establish the base case; instead, one needs to prove the statement for an infinite subset of the natural numbers. For example, [[Augustin Louis Cauchy]] first used forward (regular) induction to prove the [[Inequality of arithmetic and geometric means#Proof by Cauchy using forward–backward induction|inequality of arithmetic and geometric means]] for all [[powers of 2]], and then used backwards induction to show it for all natural numbers.<ref>{{Cite web|url=https://brilliant.org/wiki/forward-backwards-induction/|title=Forward-Backward Induction {{!}} Brilliant Math & Science Wiki|website=brilliant.org|language=en-us|access-date=2019-10-23}}</ref><ref>Cauchy, Augustin-Louis (1821). [http://visualiseur.bnf.fr/Visualiseur?Destination=Gallica&O=NUMM-29058 ''Cours d'analyse de l'École Royale Polytechnique, première partie, Analyse algébrique,''] {{Webarchive|url=https://web.archive.org/web/20171014135801/http://visualiseur.bnf.fr/Visualiseur?Destination=Gallica&O=NUMM-29058 |date=14 October 2017 }} Paris. The proof of the inequality of arithmetic and geometric means can be found on pages 457ff.</ref>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)