Inspired by Bulbuul Dev

Algebra Level 5

Let i 2 , k 2 i \ge 2, k \ge 2 be positive integers and let f ( g ( x ) ) f(g\left( x \right) ) be the number of distinct (not necessarily real) roots of the equation g ( x ) = 0 g(x)=0 .

Compare A = f ( n = 1 i ( x k n 1 ) ) \displaystyle A=f\left( \prod _{ n=1 }^{ i }{ \left({ x }^{ kn }-1\right) } \right) with B = k n = 1 i n \displaystyle B=k\sum _{ n=1 }^{ i }{ n } .

Inspiration.

A = B A=B A < B A < B Not enough information Comparison Incorrect A > B A > B

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Aryaman Maithani
Jun 16, 2018

To evaluate A, we have to count the number of distinct solutions of:

( x k 1 ) ( x 2 k 1 ) ( x i k 1 ) = 0 (x^k-1)(x^{2k}-1)\dots(x^{ik}-1)=0

Each factor in itself has number of solutions equal to its degree (including complex solution)

\therefore total number of solutions = N = k + 2 k + i k = k n = 1 i n = B N = k + 2k + \dots ik = k\sum\limits_{ n=1 }^{ i }{ n } = B

However, all the solutions counted above are not distinct, it can be clearly seen that all the roots of ( x k 1 ) = 0 (x^k-1)=0 are also the roots of ( x 2 k 1 ) = 0 (x^{2k}-1)=0 .

A < N \therefore A < N

A < B \implies \boxed{A < B}

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...