brs1cob
is there a better solution to this problem.
plug and play is not suitable n it is time-consuming.
KM2018AA brs1cobMy approachNote that x can be either of 3k, 3k+1, or 3k+2, where k integer > 1. This means that each root of the polynomial must yield an integer with a different remainder when divided by 3.
Then do the following
1. Factor the polynomial
2. Check for every option if there is always a factor divisible by 3
Alternative A1. x^3+3x2−10x = x(x+5)(x-2)
2. Check
- If x = 3k, then x(x+5)(x-2) = (3k)(3k+5)(3k-2), which is divisible by 3, since 3k is
- If x = 3k+1, then x(x+5)(x-2) = (3k+1)(3k+6)(3k-1), which is divisible by 3, since 3k+6 = 3(k+2) is
- If x = 3k+2, then x(x+5)(x-2) = (3k+2)(3k+7)(3k), which is divisible by 3, since 3k is
Also, note that you can quickly eliminate a few alternatives by noting that the polynomial have repeated roots, such as alternative C and E.