• Best of luck to the class of 2024 for their HSC exams. You got this!
    Let us know your thoughts on the HSC exams here
  • YOU can help the next generation of students in the community!
    Share your trial papers and notes on our Notes & Resources page
MedVision ad

prove this by induction (1 Viewer)

phoenix159

Member
Joined
May 19, 2013
Messages
79
Gender
Male
HSC
2014
Prove by induction: 5n + 6n - 1 is divisible by 10 for all integers n
 

integral95

Well-Known Member
Joined
Dec 16, 2012
Messages
779
Gender
Male
HSC
2013
for n = 1 LHS = 10

Assume true for n = k where k is an integer i.e

for n = k+1 (I'll be skipping most of the algebra)



now 5 - 5^k is divisible by 10 since 5^k will always have the last digit 5 and so there fore 5 - 5^k has the last digit of 0 hence the whole expression is divisible by 10 so there fore it's true for n = k+1

Edit: btw this is only true for all positive n integers NOT all integers
 
Last edited:

RealiseNothing

what is that?It is Cowpea
Joined
Jul 10, 2011
Messages
4,591
Location
Sydney
Gender
Male
HSC
2013


All that is left is to prove is odd since always ends in a 5. This is obvious as all the powers of 6 are even, then the on the end makes it odd. #
 

Users Who Are Viewing This Thread (Users: 0, Guests: 1)

Top