1)Let A=, where a and b are postive integers.
Prove that A≠2015. (HINT-Use Modular Arithmetic or Try to use the concept of Odd-Even numbers)
2)Prove that any prime number, cannot be represented as a difference of 2 fifth powers of integers.(HINT-Expand the expression and You will get something in common)
3)Find all pairs (x,y) where x and y are integers such that .(HINT-Try to apply identities)
4)If
Then Prove that,
.(HINT-Factorize )
5)Prove that is divisible by 7.(HINT-Use Modular Arithmetic or Apply the concept of .)
Today I have posted some easy problems ,So I'm sure that you will be able to solve all these 5 problems in 1.5 hours.
Also try my Set RMO.
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
Here's my solution to (1).
Assume that ,
(a+b)2+2ab=2015
(a+b)2=2015−2ab
So, (a+b)2=Odd
So,(a+b)=Odd(2q+1)For some positive integer q.
So,2ab=4pFor some integer p.
So, (2q+1)2+4p=2015
4(q2+q+p)=2014
q2+q+p=42014
Now we can see that R.H.S.is not an integer but In L.H.S. all are intgers .Thus it does not satisfy the given conditions.Hence Proved.
1) a2+4ab+b2=0,2or1mod4 but 2015 = 3 mod4. A contradiction.
Log in to reply
Nice Observation!! I'm having an different solution!!You can try out other problems!!I will post my solutions after some days!!!!!!!
Just a small correction, a2+4ab+b2 can also be 0(mod4).Try using \pmod for mod. I too did it exactly the same way.
Log in to reply
Yes,of course!! You can post your solutions if you have solved any or have an different solution from others!!!
I seems that you have solved all problems on this Set,You can try my other problems of this set and Try my set Olympiad Preparation setfor an easier level!!
2) Suppose 22n+1=a5−b5,where a5−b5 be the difference of two fifth powers.a5−b5=(a−b)(a4+a3b+a2b2+ab3+b4) wherea>b.
Since 22n+1isprime,a−b=1.
By Fermat's Little theorem, 22n+1=a5−b5=a−b(mod5)=1(mod5).
Thus 22n+1 cannot be represented as a difference of two fifth powers.
Moreover, 22n+1 cannot be represented as the difference of two pth powers, where p is an odd prime.
5) 5555=4(mod7) or 55552222=42222(mod7)
43=1(mod7) or 42220=1(mod7) or 42222=16=2(mod7)
Therefore, 55552222=2(mod7).
Similarly,
2222=3(mod7) or 22225555=35555(mod7)
33=−1(mod7) or 35553=(−1)1851=−1=6(mod7) or 35555=54=5(mod7)
Therefore, 55552222=5(mod7)
Therefore 55552222+22225555=2+5=7=0(mod7)
Log in to reply
It seems that you have solved all problems of this note,You can my other problems of this set.Try my set Olympiad Preparation Set for an easier level !!
4) let p(x)=x3+lx2+mx+p with roots a,b,c then p=mn and c=−b . Now it easy
Log in to reply
Nice!!You got a different to solve this!
Thanks for your contribution for the Brilliant RMO community :)
Log in to reply
Its OK .I am also preparing for RMO so just posting some problems daily..!!!!
4) This one is quite long! After a lot of solving I got c=-a or c=-b . Substitute both the values and you get the second equation. Am I missing an easier method?
Log in to reply
Here's my solution to (4). a1+b1=a+b+c1−c1
aba+b=(a+b+c)×cc−(a+b+c)
(a+b)×c×(a+b+c)=−(a+b)×ab (Don't remove (a+b) from both sides!Why?See Ahead!!!)
(a+b)×c×(a+b+c)+(a+b)ab=0
(a+b)[c×(a+c)+b×(a+c)]=0
(a+b)(b+c)(c+a)=0
a=-b or b=-c or c=-a.
Now substitute anyone value and it will proved!!
Log in to reply
@naitik sanghavi Nice!!.I multiplied (ab+bc+ca) with (a+b+c),did a little bit of factoring and got c2+(a+b)c+ab=0 and finally solved the quadratic equation to get the above solution.Your solution is much faster upvoted!!
You can also generalize it for powers of n and then by induction it will be proved for 3.
3) Is (-11,0),(0,11) the only solutions?
Log in to reply
Yes!!Correct but you need to prove that there are no other solutions too!!
Log in to reply
@naitik sanghavi y=3x3+113=3(x+11)(x2−11x+121) which is only a perfect cube when either of the terms are zero. Hence, getting the above solution.
Solution to Q3,
Through Fermat's last theorem
az+bz=cz
has no natural number solutions for
z>2
So in,
x3+113=y3
Either one of them is 0 or both of them negative,
if x and y are negative,
let x=−a and y=−b for positive a and b.
So,
b3+113=a3
This has no solutions for positive integers.
So one of x or y is 0,
if x=0,y=11 and when y=0,x=−11
Therefore the equation has only two solutions,
(0,11),(−11,0)