These are the questions of the NMTC final stage.
Hope you people will help me and others by showing how to solve these questions. Different and innovative ways of solving the questions are appreciated:)
a) 28 integers are chosen from the interval [104, 208]. Show that there exists 2 of them having a common prime divisor.
b) AB is a line segment. C is a point on AB. ACPQ and CBRS are squares drawn on the same side of AB. Prove the S is the orthocentre of the triangle APB.
a) a,b,c are distinct real numbers such that . Find the numerical value of abc.
b)
find [a], where [a] denotes the integer part of a.
The arithmetic mean of a number of pair wise distinct prime numbers is 27. Determine the biggest prime among them.
65 bugs are placed at different squares of a 9*9 square board. Abug in each moves to a horizontal or vertical adjacent square. No bug makes 2 horizontal or vertical moves in succession. Show that after some moves, there will be at least 2 bugs in the same square.
f(x) is a fifth degree polynomial. It is given that f(x)+1 is divisible by and f(x)-1 is divisible by . Find f(x).
ABC and DBC are 2 equilateral triangles on the same base BC. A point P is taken on the circle with centre D, radius BD. Show that PA, PB, PC are the sides of a right triangle.
a,b,c are real numbers such that a+b+c=0 and . Prove that . When does the inequality hold?
Please reshare this note so that it can reach to the experienced and other brilliantians who will help us :)
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
Q7) a+b+c=0a+b=−ca2+b2+(−a−b)2=1a2+ab+b2=21a2+ab+(b2−21)=0
Similarly we get that c2+cb+(b2−21)=0 which implies that a and c are the roots of the equation x2+bx+(b2−21)=0. But a, c are reals. So, its discriminant is greater than or equal to 0, which infers that b2≤32
So, product of the roots i.e. ac=b2−21.
So, a2b2c2=b2×(b2−21)2. But b2≤32. It implies that
a2b2c2=b2×(b2−21)2≤32×(32−21)2=32×361=541
It is observed that equality holds when b2=32 i.e. b=±62. At the same time when b2=32 which implies that discriminant =0 which infers that roots are equal i.e. a=c. So the equality holds when (a,b,c)=(∓61,±62,∓61).
Log in to reply
Thanks for the equality part too! Well can you tell me about the fourth question?
[This is a type of inequality question that I like, where a different perspective can help you approach the problem in a simpler way. I do feel that this approach is under appreciated, esp for cases where the equality case consists of 2 variables (out of 3) being equal.]
If you use the Cubic Discriminant, you can simplify the proof into a "one-liner".
Essentially, we have a+b+c=0,ab+bc+ca=−21,abc=S. Then, a,b,c are the real roots to the cubic x3−0x2−21x−S=0, which tells us that the cubic discriminant is ≥0. This gives us:
Δ=0.5−27S2
And hence (abc)2≤541.
Equality holds when 2 of the roots are equal. Inequality holds otherwise (and depending on how much you think they want, you should hunt down the equality case, but I'm lazy.)
Looking at the graph of y=x3−21x, this idea is made even clearer. We are told that there are 3 real roots, and want to determine the largest value of (abc)2, which is the square of the constant term, which determines how high or low the graph is shifted. Obviously, this occurs at the local max/min, and we can use calculus to determine this value (if we didn't know about the cubic discriminant!
Log in to reply
Thank you for help! :)
Sir can you please look into the fourth question since nobody is answering me
Q-2 b) It's a well known series,x=1∑∞x21=6π2∼1.64.
Therefore, a = x=1∑2015x21 will be definately larger than 1 and less than 1.64.
Hence, [a]=1
Log in to reply
Thanks! Have a look at Q4
How will you prove it?
Log in to reply
There's no need to find the exact value of given summation..
Log in to reply
Note that the expression is equal to zeta(2). Zeta(2)=π^2/6. See here
Log in to reply
Log in to reply
Log in to reply
Log in to reply
Q4 as currently phrased is wrong. We can have 8×9=72 bugs placed in the top 8 rows, and then they move down and up and down and up.
It might require "no bug makes 2 vertical moves in succession", or that "bugs alternate between horizontal and vertical moves".
Log in to reply
Sir I am really sorry. The question is exactly what you said. No bug makes 2 horizontal or 2 vertical moves in succession. My apologies. Since I am using my phone, I will edit it tomorrow. Can you tell us about your answer
Sir @Calvin Lin can you help me?
Here's my approach .If u find any flaws in my proof please let me know.
Given:
a+b+c=0,a2+b2+c2=1
apply A.M G.M inequality for a,b,c
3a+b+c≥3abc
30≥3abc
0≥abc⟹eq.1
applyA.MG.Minequalityfora2,b2,c2
3a2+b2+c2≥3a2b2c2
31≥3a2b2c2
271≥a2b2c2
27abc1≥abc⟹eq.2
eq.1+eq.2⟹27abc1≥2abc
541≥a2b2c2
Log in to reply
AM-GM is applicable for positive reals only. Although the answer may be correct but you have to first check that they are positive. Even dev sharma had said the same thing but it was not applicable.
Log in to reply
Thanks for replying
Log in to reply
@Dev Sharma @Kushagra Sahni you may tag others too but please refrain from mass tagging:p
can someone please tell me how to insert image?
Log in to reply
Can you write it in LaTeX?
ok i may write the answers : Ques 2(a): 2 ;
2(b): 1:
Ques 3: 47 .
Log in to reply
The question was unclear. Whether we are looking for a sequence of primes or pairwise primes (coprimes). In both cases we can have larger values than 47. For example, the sequence 3, 5, 73. So keep trying!
How did you solve 2(a)?
Log in to reply
Let a2+b2+c2=k where k is constant.
Now, write the first equation as a3+3a2=3(a2+b2+c2)−25=3k−25
⟹a3+3a2+25−3k=0
Likewise, we can write the same in "b" and "c".
Therefore, we see that a,b and c are the solutions to the equation x3+3x2+25−3k=0
Now, by Vieta's formulas, we can see ∑a2=(∑a)2−2∑ab=(−3)2−2∗0=9
Therefore abc=−(25−3k)=−(−2)=2
Did anyone solved Q1??
Log in to reply
the ans is 104,208 only .for proving i don't know how to explain my thinking ..im sorry.....
but i'll try.. let the 24 integers be the four multiples from 104 to 208. by prime factorizing 104 u will get 2^3/times13.. and by prime factorizing 208 u will get2^4/times 13.so in these 2 nos ony we have a common factor 2^3/times13.so it is the solution.
but if u ask why don't any other no will have a common factor means.... the other nos wont why because the starting no is 104 i.e2^#/times13 so the common factor must be this one..so if u multiply 2^3/times13 with any other integer other than one is the minimum value is 208 only i.e 2^3/times13/times2................that is my solution. if can understan it is well .but if u don't it is upto you.....
I have a solution. We need to prove that in our set of 28 integers at least 2 will exist having a commom prime divisor. So we will create a set of integers from 104 to 208 and try to insert as many co prime numbers as we can. We have 19 primes from 104 to 208 so we have 19 elements already in the set. Next we need other elements which are co- prime to each other and not necessarily prime. We can include product of two primes. Like 2×103( or any other prime), 3×67, 5×37, 7×29, 11×11( as no other prime can come, we can't take 13 or 17 as it will not allow us to add other elements in our set which is a prime multiples of 13 and 17, and all primes below 11 have been used), then we can add 13×13. Now no multiple of 17 can be added as any of its multiple must be less than 208 so we can product it with 7,8,9,...,12 only but all of these numbers will have a common divisor with pre existing numbers. Similarly no other multiples of primes greater than 17 can be added as they will not be co prime to other elements in the set. So we get 19+6=25 elements in our set all of which are co prime to each other. 26th element will have a common prime divisor with atleast one of them. So when we choose 28 obviously there will be at least 2 having a common prime divisor. I think that proves.
Log in to reply
You have the right ideas. However, they are not clearly presented and you're making a lot of assumptions. For example, you seem to be saying that we must take "the numbers 2×103, 3×67, etc ". Instead, you should find a way to paraphrase it such that we easily allow for the "any other prime" aspect of it. There is a much cleaner way to present this argument. Think about how to use the pigeonhole principle.
Log in to reply
7) ab+bc+ca=−1/2
let a,b,c be roots of
x3−(1/2)x−abc=0
now we know to find discriminant of this
27(abc)2<4.(1/2)3=1/2
we're done!
i hav sol for Q1)b)...
Log in to reply
Then please post it
Log in to reply
i don't know how to post sry
Did anyone get q6??
Just in a few hours ill appear 2016 nmtc finals!!
Q1.b) CR is parallel to AP extended. So altitude to AP is perpendicular to CR. Thus it passes through S (as it has to be the other diagonal). PC already goes through S. QED
Q2.a) Generate a symmetric function whose roots are a,b,c. Use Vieta's Formulae and proceed. abc=2
Q2.b) Use Basel Result of the sum of inverse squares (Zeta(2)). As this sum is smaller than it but bigger than 1, its integer part is equal to 1.
Q6. Use basic coordinate geometry and prove that (PA)^2 = (PB)^2 +(PC)^2.
Q7. Form a quadratic and make discriminant non negative to get the stronger version of the inequality.
Equality occurs when a= -+ 1/sqrt6 b= +- sqrt(2/3) c=a
Q1.a) , Q4 are based on the application of the Pigeon-Hole principle. Hope I helped.
Can someone please post the complete solution to Q2.b.....Please....
There is some problem in question 7.
It is given that a2+b2+c2=1 . We also have prove it..?
Question asks when does this inequality holds..but there is no inequality in question 7
Log in to reply
As pointed out by @naitik sanghavi , the question is what he has written. I will edit it tomorrow. I am currently using my phone . BTW how many did you solve? And please share your answers.
Log in to reply
Tomorrow is my exam and my coaching class too... I will solve them on day after tomorrow..Thanks for sharing
Log in to reply
I did Q1) b) using Pythagoras and similarity :P
Log in to reply
Can you tell me about the fourth question and please tell your approach
For Q7) I am getting a2b2c2≤361 :(
Log in to reply
That's what many people are getting I guess. But I have been told by others that there is no problem with the question and you have to use jensons inequality.
Log in to reply
I used Cauchy Schwarz ...
Log in to reply
Log in to reply
Log in to reply
Log in to reply
Log in to reply
There is a proof without using that too.
Hint.Form a cubic polynomial.
Log in to reply
Log in to reply
(a-b)²≥0
a²+b²+ab≥3ab...(1)
a+b+c=0
c=-a-b
Also,a²+b²+c²=1=a²+b²+(-a-b)²
2a²+2b²+2ab=1
a²+b²+ab=1/2...(2)
From (1) and (2) we have,
ab≤1/6.....(3)
a²b²c²=a²b²(a²+b²+2ab)
=(ab)²(1/2+ab)
From(3)
a²b²c²≤1/36(1/2+1/6)≤1/36×2/3
a²b²c²≤1/54
Hence proved.
Sorry,I couldn't use latex as I'm preparing for NTSE!!
Log in to reply
Problem. 7. Is easy.
a^2 + b^2 + ab = 1/2
by am gm ab<1/6
now its easy
Log in to reply
From where did u get a^2 + b^2 + ab = 1/2?
Log in to reply
use the fact a + b = -c
Log in to reply
Am gm cannot be applied as a,b,c are real numbers not necessarily positive.
Log in to reply
Correct, AM-GM concept is applicable only for positive numbers
there is one other idea too
form a cubic polynomial and find its discriminant
Log in to reply
Exactly
(Q3)There are only four pairs of primes whose mean is 27.
(47,7)(11,43)(41,13)(19,37)
So,the biggest prime among them is 47!!
2)a) i am getting a = b = c = 5
Log in to reply
a,b,c are distinct
Log in to reply
Oh, sorry!!
Let me know your approach.
Q7) Please find mistake in this:
Using Cauchy Schwarz inequality ,
(abc+abc+abc)2≤(a2b2+b2c2+a2c2)(c2+a2+b2)⇒(3abc)2≤(a2b2+b2c2+a2c2)
Setting x=ab , y=bc ,z=ac , a2b2c2≤9x2+y2+z2…(1)
Note that x+y+z=2(a+b+c)2−(a2+b2+c2)=2−1
xy+yz+xz=ab2c+abc2+a2bc=abc(a+b+c)=0
Thus, x2+y2+z2=(x+y+z)2−2×(xy+yz+xz)=(2−1)2−0=41
Putting x2+y2+z2=a2b2+b2c2+a2c2=41 in (1) , we get
a2b2c2≤361
Log in to reply
The inequality works for positive numbers. But due to the given condition the inequality must be edited accordingly.
Log in to reply
It works for all real numbers. I didn't get your second sentence.
Log in to reply
There is no flaw here. Its just that you have come up with a weak inequality. Use Cauchy-Shwarz equality condition and you'll see that the equality doesn't occur. We need to find the stronger version ( as 1/54 < 1/36). For example, one may also conclude here that abc<1. It is true, but weak.
Even my answer was like yours and I'm unable to find flaws it.
Log in to reply
Once again, with inequalities, all that you have shown is an upper bound. You need to show that it is the least upper bound, in order to be a maximium. What’s your equality case?
Otherwise, you have not proven that there is a contradiction, since 541≤361, so it is still possible for (abc)2≤541, and you just haven't shown it yet.
Log in to reply
(abc)2? 1/36 won't work.
Sir, I feel this arguement is incorrect. What if it was asked to find the maximum value of