Please take some your time to clarify my doubts:
Find the coefficient of \( { x }^{ 98 }\) in the expansion of\( \left( 1+x+{ x }^{ 2 }+{ x }^{ 3 }+...+{ x }^{ 99 } \right) ^{2}\)
The sides of a quadrilateral are all positive integers and three consecutive sides are , and . How many possible values are there for the fourth side?
What is the maximum number of intersecting points formed with four circles and two straight lines?
If a natural number has divisors and has only two prime divisors then what is the number of divisors of ?
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
The first one,
= (1+x+x^2+x^3+..........+x^99)(1+x+x^2+x^3+..........+x^99).
to find coefficient of x^98 is,
1(by multipling 1 and x^98)+1(by multipling x and x^97)+1(by multipling x^2 and x^96)+..................+1(by multipling x^98 and 1) = 99.
Please correct me if I am wrong.
Log in to reply
Oh, I get it! Thanks!
The third one,
2 straight lines intersect at maximum 2C2 points which is 1. A line and a circle intersect at 2 points. So, 2 lines and 4 circles intersect at 2C1 x 4C1 x 2 points = 12. 2 circles intersect at two points. So, 4 circles intersect at 4C2 x 2 = 12 ways.
So, maximum number of intersections is 1+12+12 = 25.
Correct me if I am wrong.
[This is not a solution, just a comment]
Note that your first question has a nice combinatorial interpretation:
Find the number of ways in which you can get a sum of 98 by adding two elements of the set A={0,1,2,…,99} and order of selection of elements is significant, i.e., selecting (a,b) is different from selecting (b,a).
The product in the problem is just the generating function for the above combinatorial problem and the coefficient of x98 denotes the number of ways in which you can sum two elements from the set A to get 98.
For the last doubt i think the number of divisors of n is 18
Log in to reply
18 is there in the options. Can you tell the process please?
Log in to reply
let p and q the prime divisors of n and n=pm.qk so the number of divisors of n is (k+1)(m+1).
and n2=p2m.q2k so the number of divisors of n2 is (2m+1)(2k+1)=55=5×11 so k=2andm=5 which mean the number of divisors of n is 3×6=18
Log in to reply
Log in to reply
It is 18.
n^2 has 55 factors which is 5 x 11.
which is (a+1)(b+1) where n^2 = x^a * y^b where a and b are powers of two primes x and y.
Hence, a and b are 4 and 10.
And n = x^2 * y^5 or x^5 *y^2.
Now the number of factors of n is (2+1)(5+1) = 18.
Hope that helps!
1) 99. 2) 551?
Yeah. I had made a grave error for the second question. Here's the answer: 34
Log in to reply
Please post the solution.
Log in to reply
Sure, let's talk in the lounge?
Log in to reply
Log in to reply
(3−3)cosθ
The answer should beLog in to reply
3sin(θ) as tan(θ) is equal to root(3) -1. take root(3) common and put root(3) -1 as tan(θ).
Which is equal toLog in to reply
Log in to reply
Log in to reply
Log in to reply
Log in to reply
2cos(theta)+sin(theta) is not equal to 2root(3)cos(theta).
And the values of possible length's that the third side can take are, 33, 32, 31, 30, 29, 28, 27 . . . , 1, 0
@Swapnil Das ,
In your question trigo fun, I think the answer is 3sin(θ). Can you post the solution please.
Log in to reply
Thanks, I have deleted the problem and I will repost it later.
@Swapnil Das which book you refer for solving these types of questions?and also are you giving nmtc this year?
Log in to reply
I mostly refer internet for solving these type of problems ( Brilliant is only source). No.