Hi guys. I just have a quick question about proof by induction. Is it as easy as some examples make it seem to be? Is it just establishing that something like 2*n= 2n is correct, and then establishing that 2*n+1 = 2n+1 is correct?

File: 34 KB, 422x347, 1308949780009.jpg [View same] [iqdb] [saucenao] [google]

Anonymous Thu Nov 1 04:51:53 2012 No.5213537 [Reply] [Original]

Hi guys.
I just have a quick question about proof by induction.
Is it as easy as some examples make it seem to be?

Is it just establishing that something like 2*n= 2n is correct, and then establishing that 2*n+1 = 2n+1
is correct?

>>	Anonymous Thu Nov 1 04:51:37 2012 No.5213539 >>5213537 yes

>>	Anonymous Thu Nov 1 04:54:37 2012 No.5213541 >>5213539 thank you

>>	Anonymous Thu Nov 1 04:56:37 2012 No.5213545 >>5213541 no problem.

Anonymous Thu Nov 1 05:50:32 2012 No.5213589

>>5213537
You have to show it is true for a base case as well. Induction says that if it is true for one case it is true for the next.

You can show that if the sum of natural numbers up to n is (1/2)(n+(1/2))^2 then the sum of natural numbers up to n+1 is (1/2)(n+1+(1/2))^2.

Advanced search
Text to find
Subject [?]Search by post subject. Leave empty for any.
Username [?]Search for user name. Leave empty for any user name.
Tripcode [?]Search for tripcode. Leave empty for any.
Email [?]Search by email. Leave empty for any.
Filename [?]Search by image filename. Leave empty for any.
From Date [?]Enter what date to start searching from. Format is YYYY-MM-DD
To Date [?]Enter what date to start searching until. Format is YYYY-MM-DD
Image hash
Search in	All Posts OPs Only
Deleted posts	Show all posts Show only deleted posts Only show non-deleted posts
Internal posts	Show all posts Show only internal posts Show only archived posts
Order	New posts first Old posts first
Capcode	All Posts Only by Users Only by Mods Only by Admins Only by Developers
Results	Posts Threads
Action	[ Simple ]

/sci/ - Science & Math