#proof by contradiction
55 messages · Page 1 of 1 (latest)
Assume n^2 is a multiple of 3 and n is not a multiple of 3
n = 3k+1,3k+2
n^2 can’t be a multiple of 3
So a contradiction has occurred, n^2 must be a multiple of 3
You could also have an argument about the prime factorisation
not a multiple of 3 innit
well ur supposed to
Who the heck is that
a level maths youtube guy
He probably did 3k-1,3k,3k+1
zeeshan zamurred
fr
just derive it fr
Not cool
What would Clarence say
🤔 I think he’s missing a case
He would not 😔
@david
if you can disprove it for only 3k+1 then isnt that sufficient
if it aint true for one case the statement isnt true at all
i could be yapping
u would have to show it for 3k+2 too
thats just what i think
looks like that question is from the textbook
check the solution bank if you can
i think u would lose 1/3 for not checking 3k+2
idk this topic is shit anyway
ye its long
better not be a 5 mark question on this in the exam
i like when its just proving something is irrational
i havent done A2 integration yet people always say its the hardest topic
theres only about 3 no?
is there?
whys the chapter so long in the textbook tho
theres other things like trapezium rule and something to do with differential equations i think
idk but once you get the hang of it it feels like only a few bits
integration is harder than differentiation as theres multiple ways to integrate whereas differentiation its literally same thing every time
We need to consider all values that aren’t a multiple of 3. Let’s say we let n=3k+2 and n^2 did actually lead to a multiple of 3 then do we assume the statement is actually true? If there is more than one case you’d need to include it to get all the marks
Cos otherwise it could be sometimes true