BrillhartTests UPΒΆ
brill.spad line 1 [edit on github]
This package implements Brillhart irreducibility test.
- brillhartIrreducible?: (UP, Boolean) -> Boolean
brillhartIrreducible?(p, noLinears)returnstrueifpcan be shown to be irreducible by a remark of Brillhart,falseelse. If noLinears istrue, we are being toldphas no linear factorsfalsedoes not mean thatpis reducible.
- brillhartIrreducible?: UP -> Boolean
brillhartIrreducible?(p)returnstrueifpcan be shown to be irreducible by a remark of Brillhart,falseis inconclusive.
- brillhartTrials: () -> NonNegativeInteger
brillhartTrials()returns the number of tests in brillhartIrreducible?.
- brillhartTrials: NonNegativeInteger -> NonNegativeInteger
brillhartTrials(n)sets tonthe number of tests in brillhartIrreducible? and returns the previous value.
- noLinearFactor?: UP -> Boolean
noLinearFactor?(p)returnstrueifpcan be shown to have no linear factor by a theorem of Lehmer,falseelse.Iinsist on the fact thatfalsedoes not mean thatphas a linear factor.