hey guys
just wondrin if ne1 can help me with this q, i found it in an old SHORE SKOOL exam paper
its one of the last questions, and its really bloody hard, but since every1 at my school is pretty shit at maths nobody i know can answer it lol
here it is:
Using mathematical induction, prove that (1-x)^2 - nx - 1 is divisible by x^2, for n greater than or equal to 2, n integer.
wat the hell is mathemtical incundtion? apparenlyl its in the syllabus, but i have nfi what it means
also, is this kind of q likely to come up in the exam, or are our internal exams just harder than the actual school certificate exams? after all, our school probably is overall better than most
just wondrin if ne1 can help me with this q, i found it in an old SHORE SKOOL exam paper
its one of the last questions, and its really bloody hard, but since every1 at my school is pretty shit at maths nobody i know can answer it lol
here it is:
Using mathematical induction, prove that (1-x)^2 - nx - 1 is divisible by x^2, for n greater than or equal to 2, n integer.
wat the hell is mathemtical incundtion? apparenlyl its in the syllabus, but i have nfi what it means
also, is this kind of q likely to come up in the exam, or are our internal exams just harder than the actual school certificate exams? after all, our school probably is overall better than most