kooltrainer
New Member
- Joined
- Jun 17, 2006
- Messages
- 659
- Gender
- Male
- HSC
- 2008
prove by induction 7^k + 3K(7^k) -1 is divisible by 9
shuldnt be too hard ? gimi sum suggestions
shuldnt be too hard ? gimi sum suggestions
Students helping students, join us in improving Bored of Studies by donating and supporting future students!
maybe get it in the form 9m where m is the other factor in terms of k... somehow.prove by induction 7^k + 3K(7^k) -1 is divisible by 9
shuldnt be too hard ? gimi sum suggestions
I believe this is a kind of divisibility/number theory/modular arithmetic/ induction problem. You would find these kind of problems at national mathematical olympiads.@kurt: do you know induction (for divisibility)?
(you let the expression for k=n equal, say 9m, then show that the expression is also true for k=n+1 if it is true for k=n)
so yeah, you get the k+1 expression in the form of 9M, but in order to do this you will need to do a separate induction proof to show a part of the expression is also divisible by 9
bahaha umm.. also quite common in NSW HSC. National Olympiad pfftI believe this is a kind of divisibility/number theory/modular arithmetic/ induction problem. You would find these kind of problems at national mathematical olympiads.
lol.bahaha umm.. also quite common in NSW HSC. National Olympiad pfft
P.S: 500th post, glad i dedicated it to a maths based forum