Re: [sage-support] Irreducibility of polynomials

Hi Martin, danke für die schnelle Rückmeldung. So wie es scheint basiert der Test auf DDF, was vermutlich langsamer ist im Vergleich zu Rabins Test wenn grad(f) = p = prim. Im allgemeinen Fall aber die schnellere Variante. Danke nochmal, viele Grüße Am Mittwoch, 7. Mai 2014 15:35:45 UTC+2 s

Re: [sage-support] Irreducibility of polynomials

Here's how to find out: sage: P. = GF(2)[] sage: f = P.random_element() sage: f.is_irreducible?? if 0 == GF2X_IterIrredTest(self.x): return False else: return True Okay, what's GF2X_IterIrredTest? sage: search_src("GF2X_IterIrredTest") libs/ntl/ntl_GF2X_d

[sage-support] Irreducibility of polynomials

Hi everyone, I would like to know which test Sage uses to test irreducibility of a polynomial over GF(2). Is it Rabin`s Test? How to compute the first condition? I am not asking for the command, just the technique . Thanks. -- You receive