It's a mathematical induction type of problem:
Prove that for all integers:
133 | 11^(n+...
Mathematics, 12.04.2020 00:32 sliim89
It's a mathematical induction type of problem:
Prove that for all integers:
133 | 11^(n+2) + 12^(2n+1) where 133 here is divider of 11^(n+2) + 12^(2n+1)
So far I've checked statement to be true for n=1 and n=k
133 | 11^(k+2) + 12^(2k+1)
11^(k+2) + 12^(2k+1) = 133m
but I have a problem with proving n=k+1
Answers: 2
Mathematics, 21.06.2019 16:30
Why do interests rates on loans to be lower in a weak economy than in a strong one
Answers: 3
Mathematics, 21.06.2019 22:30
If x-1 and x+3 are the factors of x3+10x2+ax+b find a and b
Answers: 1
Mathematics, 12.07.2019 03:00
Mathematics, 12.07.2019 03:00
English, 12.07.2019 03:00
Mathematics, 12.07.2019 03:00
Mathematics, 12.07.2019 03:00
Mathematics, 12.07.2019 03:00
Biology, 12.07.2019 03:00
Advanced Placement (AP), 12.07.2019 03:00
Mathematics, 12.07.2019 03:00
Mathematics, 12.07.2019 03:00
Mathematics, 12.07.2019 03:00
English, 12.07.2019 03:00
Chemistry, 12.07.2019 03:00
History, 12.07.2019 03:00