PLs Complex Numbers Polynomials Questions ASAP Help PLS (1 Viewer)

Modern4DaBois

Member
Joined
Oct 25, 2021
Messages
42
Gender
Male
HSC
2022
Can someone pls help with Question 17, and Question 16 (part d)?
Thank you so much! 😀

Screen Shot 2021-12-02 at 11.15.25 pm.pngScreen Shot 2021-12-02 at 11.17.15 pm.png
 

CM_Tutor

Moderator
Moderator
Joined
Mar 11, 2004
Messages
2,644
Gender
Male
HSC
N/A
For question 17, a polynomial can inly have a multiple root if there are any -values for which , using the multiple root theorem. If you attempt to solve the equation , you should find it has only one solution, . However, and so the only potential multiple root isn't a root at all, and so there are no multiple roots.

In fact, if is extended to an infinite polynomial, it is the polynomial version of , as indicated by the fact that you then have and thus there are no zeroes of at all.
 

Modern4DaBois

Member
Joined
Oct 25, 2021
Messages
42
Gender
Male
HSC
2022
For question 17, a polynomial can inly have a multiple root if there are any -values for which , using the multiple root theorem. If you attempt to solve the equation , you should find it has only one solution, . However, and so the only potential multiple root isn't a root at all, and so there are no multiple roots.

In fact, if is extended to an infinite polynomial, it is the polynomial version of , as indicated by the fact that you then have and thus there are no zeroes of at all.
Ah kk That makes sense now. Thanks!
Your explanations are really good btw.
 

5uckerberg

Well-Known Member
Joined
Oct 15, 2021
Messages
562
Gender
Male
HSC
2018
Q16d
This is going to get an interesting one. First step find the factors of 2702, this is because we are using the product of roots to our advantage. The second step find a ceratin set of factors and then you add and minus them these will form the x squared term. Third step fidn a term that is the square of the x squared terms that you introduced.
Lastly factorise and finish off the question.
 

Users Who Are Viewing This Thread (Users: 0, Guests: 1)

Top