[ 3 / biz / cgl / ck / diy / fa / ic / jp / lit / sci / vr / vt ] [ index / top / reports ] [ become a patron ] [ status ]
2023-11: Warosu is now out of extended maintenance.

/sci/ - Science & Math


View post   

File: 10 KB, 645x773, 1503345300770.png [View same] [iqdb] [saucenao] [google]
10683160 No.10683160 [Reply] [Original]

How do you prove by induction?

>> No.10683167

>>10683160
Theorem: 10 is the biggest number
Proof:
Base case: n = 1 works because n < 10.
Induction case: Assume it works all the way up to k. We know that 1 < 10 and k < 10. Therefore k+1 < 10.

Therefore 10 is the biggest number.

>> No.10683208

>>10683160
Show that if it's true for k then it's also true for k+1.
Show it's true for a specific value of k.
Therefore it's true for all k>=that value.

>> No.10683240

>>10683208
Yea... btw there is actually another induction method, Cauchy Induction...
1) proof it works for some specific value k
2) proof if it works for n, it works for 2n
3) proof if it works for n, it works for n-1
Done.
I cant come up with an example atm but there do are some

>> No.10683244

>>10683160
CS majors belong in the >>>/g/hetto

>> No.10683266
File: 19 KB, 400x400, what_the_fuck_am_I_reading.png [View same] [iqdb] [saucenao] [google]
10683266

>>10683167

>> No.10683718

have a series with an infinite number of terms.

Prove that if case n is true, then case n+1 is true
This means that the next term in the series will always share the condition assuming the previous does.

So if we can prove the condition true for the first term, we can effectively prove it true for all terms. Like knocking over a line of dominos.

Another form: prove that case n+1 is true if all the previous cases are true. This is harder, but it also works. So instead of just the previous term, you need to assume your condition for all previous terms.

The reason this is powerful is because you can assume your condition.

>> No.10683727
File: 79 KB, 1800x850, rsta20090247f34.jpg [View same] [iqdb] [saucenao] [google]
10683727

>>10683718
>Assumes true planar form now that the knowledge of induction is the true workhorse of all production.

>> No.10685816

>>10683160
How do we climb infinite stairs?
We start at the base, then we prove that if we are at the base, then we can move one step up.
Question: Prove that we can get to step 500
Base case: From the base of the stairway, I can move to step one by stepping.
Induction: Assume that it is true that for all levels lower than 500, I can reach the level. If I can reach these levels, then I can reach 499. Then, I can reach 500 by stepping.
Now we have proven that if it were true that we could reach a level below 500, then we could reach 500 by stepping. We proved that we could reach level 1. Take the base case, take the induction proof, and now we proved that we can reach 500. The thing we assumed, that we can reach all levels below 500, is the induction hypothesis. The induction hypothesis doesn't HAVE to be true; It just needs to help with your base case.

>>10683167
Kill yourself

>> No.10685821

>>10685816
1) We assumed that we could get to step 499.
2) We proved that if we could get to 499, we could get to 500. Therefore, we proved that if we can get to a step, we can get to a step above it.
3) We proved we could get to step one.
3a) Use the thing we prooved in step 2. Now, step by step, we have proven that we can get to any step we want

>> No.10685825

>>10683160
In Soviet Russia, induction proves YOU.

>> No.10685831

You prove if something holds for some arbitrary number k, then it holds for k+1. Then you prove it holds for 1, so it must hold for 2, and for 3, and for 4, and 5, and 6, and 7, etc.

>> No.10685835 [DELETED] 

>>10685825
HEE!1!!!!!!11!!!!!!!!!!!!!!!!!!1111111111!!11 KEK!! KEK!! KEK!!

WHATTA FUCK MAN xD i just fell of my chair cuz i couldnt and i CANTT stop laugh xDXDXDXDXDDDDDXXXXXXDDDDDD OMGOSH DDDDDXXXXXDDDDD DDDDDD LOOOOOOOLLLLL FUCKIN HOLY SHITTTT I CANT JUST STOP LAUGHING CAUSE HE HE HE HE HE JUST TO FUNNY MAN!!!1!11!

HOOOOOOOLLLLLLYYYYY SHIT i just fall of chair!!!! simply le epic so ebin da le epin win xD pwn’d ftw le bacon narwhale xP upboated good sir i tip my fedora to you! tips fedora, le any1 athiest? LOL

GOOD JOKE

SORRY I MEAN

GREAT JOKE

GR88888 FUCKING JOKE BRO I WISH I COULD STOP LAUGHING BUT I CANT MAN!!!!

NICE JOKE IMMA REPOST TO REDDIT LELELELELE TY FOR LE KARMA XDDDDDDDDDDDDDDDD

XD

LE UPBOAT

XD

WAIT TIL LE DERPINA HEARS ABOUT THIS

XDDDDDDDDDDDDDDDDDDDDDD

EPIC JOKE /b/ro BAZINGA BAZINGA BAZINGAAAAAAAAAAAAAAAAA ZIMBABWE is this a le new epic joke? screen kapped for dat sweet karma xD. FUS ROH DAH!!!!!1 i used to be a christmas but then i took an arrow 2 da knee :^( BAZINGA BAZINGA ZIMBABWE. top kek, toppest of keks. le nyan cat? hahahaha le mayonaise. fucking epic ass joke i love that fucking joke so much man wait let me just gets crack pipe out smoke some of that good 420 shit :) rips a bong AHHHHHHHHH YES!!!!!!!!!!!!!!!

that sure hit the spot ok now repeat that fucking epic ass J O K E

>> No.10685867
File: 60 KB, 699x485, 1558216180468.jpg [View same] [iqdb] [saucenao] [google]
10685867

>>10683167
False. You forgot about negative and imaginary numbers.

>> No.10685951

>>10683160
Show true for n=1
Assume true for n=k
Prove true for n=k+1
Conclude that formula holds for n≥1
If you need me to provide an example I can.

>> No.10685957

>>10683167
>k < 10 implies k + 1 < 10
Wrong.