#inequality induction
51 messages · Page 1 of 1 (latest)
what do you not understand?
do you not know the method or smth?\
youve got to do n=k+1 AFTER the n=k then try to solve someway to get an inequality greater than the other one
lemme show u
thanks 🙏
k! > k(k+1) (assumption)
Inductive case:
you have to show that
(k+1)! > (k+1)^2 + (k+1)
(k+1)! = (k+1) * k! > k(k+1)(k+1)
(k+1)! > k(k+1)(k+1)
To show that (k+1)! > (k+1)^2 + (k+1)
Then,
show that
k(k+1)(k+1) > (k+1)^2 + (k+1)
k^3+k^2-2k-2>0
then i subbed in k=-1
and that that
(-1)^3 + (-1)^2 -2(-1) -2 = 0
so then by the factor theorem
k+1 is a factor
by inspection
it factorises to
(k+1)(k^2-2) > 0
k>=4 so
this inequality will Always hold true
so you proved it
idk if im right but thats the algebra side of the proof
OKAY i see i will write it out but it does make sense to me in my head now
thank you
nw
yh thats pretty much right
send send send
or you could do by comparison of LHS and RHS by expanding factorial and then subbing in the expression for n=k then expanding out further both sides and factorising to show one side is greater than the other by logic
alr
conclusion you already know
so i just couldnt be asked
i should have also put a line that LHS > RHS
yh ocr a
do you have predictions for tomorrow
nws
wdym?
anything you think will come up in the paper?
ocr tests everything every year
yh
theres no difference between pure 1 and pure 2 right
u can predict paper 2 after u do paper 1
yh but if u dont get something in paper 1, you will defo get it in paper 2
mech and stats
yes yes that's true
stats is fine but i gotta revise a lot for mech
good luck
wbu?
when's mech
thanks u too
i do stats and add pure
3 weeks
thats so lucky ibr
nahh add pure is so hard
but icl id rather do that than mech i dont like mech
so maybe yeah
yh but once u get used to mech its fine ibr