I can solve the first one. But not the second one.
Factorization of is . The factors are three consecutive integers. So there is exactly one multiple of 3 among them. As a result is divisible by 3.
Thanks havaliza, I've been studing divisibility with a textbook that doesn't mention factorization. But it's easier though. So just to make sure I got it, if I can proof that the expression contains a number of consecutive integers it is divisible by this number of integers?Is that right ?
You could search for when that statement happens to be true. Ie is it true when n is prime, and so on. If you can't prove a theorem in a more general way due to counterexamples, then try doing it in more restricted cases. One way to do it is to find the set of all inputs where the theorem fails, and then use this to find the set that works
No problem. Sometimes it is actualy eaiser to find the entire set of failures than one counter example. But, if this is for a course, if your teacher asks for one counterexample be sure to give just that; if you present the set, they could doc marks... I don't think they should, but my analysis teacher did that. Having the set is a lot more useful than a single counter example I think.
A little more high-browed approach has you recall Fermat's little theorem, in particular that if . So, in the above, if this is obvious, so assume that then and so and the conclusion follows. Also, induction works quite nicely since .
Also, using the Fermat's little theorem trick you can conclude that for prime