I am a newbie at Olympiad level mathematics, so I bought some books to help me, but most of the time I find myself stuck at some questions, which frustrates me very much and then leaves me hopeless, I was hoping if you guys might help me. So I'll provide those questions in this discussion, I hope you'll all help me.
If are non negative integers prove that,
Prove is an positive integer for all positive integers .
If prove that is a divisor of . Find LCM of .
Thanks in advance.
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
I don't really get what your second question means. Do you mean that the expression given will equal to k or other meaning?
Log in to reply
I am really sorry, I made a typo, I have corrected it now.
If it is interpreted as "find all k such that this polynomial is equal to k when evaluated with k" then we can easily arrive at k=−1,0,1, and these are unique solutions. But I find that the question is a bit more complicated than this.
Log in to reply
Actually, I believe he is asking to prove that the polynomial is equal to a positive integer for all positive integral k, In which case the proof is as follows:
The expression is equivalent to 1051(15k7+21k5+70k3−k), so if we can show that 15k7+21k5+70k3−k is divisible by 105=3∗5∗7 for all positive integral k then we are done. Consider the expression modulo 3, 5, and 7. We have the equivalences k3−k≡0(mod3), k5−k≡0(mod5), and k7−k≡0(mod7), which are all true for all positive integers k by Fermat's little theorem, so the expression is divisible by 105.
Q.3.i have seen this same problem some times ago but with the only difference, there is it mentioned that a,m,n are positive integer so i'm writing my solution assuming a,m,n are positive integer.
we can write,
(a2m−1)=(a2m−1+1)(a2m−2+1)(a2m−3+1)…(a2+1)(a+1)(a−1)
let,n=(m−q) where q∈1,2,3,…,(m−1)
since,m>n and n is positive
so it is clear that for any value of q, (a2n+1) is a factor of (a2m−1)
hence,(a2n+1) is a divisor of (a2m−1) if m>n
since, (a2n+1) is a divisor of (a2m−1) so LCM of this two =(a2m−1)
the second question can be done using induction and binomial theroem
Log in to reply
Can you explain.
Log in to reply
let,
P(k)=7k7+5k5+32k3−105k is an integer for k∈+Z
P(1)=71+51+32−1051=1 which is integer
P(2)=727+525+324−1052=30 this is also integer
let,P(n)=7n7+5n5+32n3−105n=N is an integer
where,n>2 and n∈+Z
Therefore P(n+1)=7(n+1)7+5(n+1)5+32(n+1)3−105(n+1)
=(7n7+5n5+32n3−105n)+(71+51+32−1051)+(n6+3n5+6n4+7n3+7n2+4n)
=P(n)+P(1)+(n6+3n5+6n4+7n3+7n2+4n)
=N+1+(n6+3n5+6n4+7n3+7n2+4n)
now,P(1) is integer,we assume P(n)=N is integer for some n∈+Z
and for any value of n∈+Z, (n6+3n5+6n4+7n3+7n2+4n) is integer.
so,P(n+1) is integer.
Thus,when ever the statement is true for n it is true for (n+1).we have checked it is true for k=1,2.so by principle of induction it is true for all positive integer.
Log in to reply