factorise the polynomial x^3+1 as a product of degree 1 and degree 2 polynomial. Use this to help find all the prime divisors of n^3+1 for akk intergers n with 2<=n<=3 So i factorised it...but then idk how to use it to help me find the divisors?
yeah i did that....but how do i use that to help me find the divisors?
can you find the divisors without using that ?
btw, divisor is just another name for factor
so plug in n = 2 and n =3 2^3 + 1 = ( 2 + 1 ) ( 2^2 - 2 + 1) = 3* 3 3^3 + 1 = ( 3 + 1 ) ( 3^3 - 3 + 1 ) = 4* 7
it wants me to find all the prime divisors using it, so i think i will have to use it
yes you will have to use it because the question is asking you to im asking whether you can find it without using that
Yeah i could find them...but i think that would be a long process. So i assume using the factorised version would speed things up?
the factorised version only speeds up when n is large
well when n is at its max allowed value i need the prime divisors of 1001
then factorised version really pays off
I feel like im being really stupid in not seeing how to use the factorised version?
still not seeing it ?
@perl gave you examples already
ohhhhhhhhhhhhhhhhhhh
you wana do another example for large n =1001 ?
this a nifty trick , if one less is a perfect cube
so when n = 10, you have (90+1)(10+1)=1001
|dw:1414069287105:dw|
Join our real-time social learning platform and learn together with your friends!