How to quickly factor n-degree polynomials?

>>8347910
not possible in general in a reasonable amount of time, sorry

>>8347938
got a proof for that?

>>8347910
why would you want to "just" factor polynomials without finding roots?

>>8347910
You could probably reverse the Pascal's triangle method somehow for ones that would end up as (a+b)^n

>>8348059
https://en.wikipedia.org/wiki/Abel%E2%80%93Ruffini_theorem#Proof

>>8348081
Because it might not have roots ? Factoring happens inside a field, finding roots might require you to go to an extension

>>8348090
That says nothing about the computational complexity of the problem.

OP, try this: https://en.m.wikipedia.org/wiki/Factorization_of_polynomials#Factoring_over_algebraic_extensions_.28Trager.27s_method.29

>>8347910
The absolute fastest way to do it is through pure guessing. Note this method sometimes produces errors.

Go to WolframAlpha and then write it out one by one on a roll of kitchen towel.
You will thank me later.

I could write a program that does this instantly, but there are programs that do this already.

>>8347910
Horner's rule to solve integerial solutions.

Numerical root finding methods for anything else.

>>8348093
use C, it's algebraically closed by God's design.