Proof by Induction: Divisibility by 17

  • Thread starter Thread starter guropalica
  • Start date Start date
  • Tags Tags
    Induction Proof
guropalica
Messages
8
Reaction score
0
Proof by induction that 3 * 5^2n+1) + 2^3n+1 is divisible by 17!
Thanks in advance guys
 
Physics news on Phys.org
In your expression, there is an ")" without an "(" --> 3 * 5^2n+1) + 2^3n+1

so it is not clear what do to!
 
You also need to try yourself and let us know where you're stuck. Then we can help.
 
I proved the base case n=1, and then I try doing the step case assuming that it satisfies for any k, then I try proving it by k+1.
I got sth like 24 * (3 * 5^(2k+1)) + 7 * 2^(3k +1) Now I'm stuck can't continue, I don't have any ideas :/
btw the initial equation is 3 * 5^(2n+1) + 2^(3n+1) !
 
Got it now :) let's denote the initial statement as K + L, so we have sth like 24l + 7k = 7(k+l) + 17k, sum of two numbers divisible by 17 is divisible by 17, anyway thx
 
The world of 2\times 2 complex matrices is very colorful. They form a Banach-algebra, they act on spinors, they contain the quaternions, SU(2), su(2), SL(2,\mathbb C), sl(2,\mathbb C). Furthermore, with the determinant as Euclidean or pseudo-Euclidean norm, isu(2) is a 3-dimensional Euclidean space, \mathbb RI\oplus isu(2) is a Minkowski space with signature (1,3), i\mathbb RI\oplus su(2) is a Minkowski space with signature (3,1), SU(2) is the double cover of SO(3), sl(2,\mathbb C) is the...
Back
Top