BrillhartTests UPΒΆ
brill.spad line 1 [edit on github]
This package implements Brillhart irreducibility test.
- brillhartIrreducible?: (UP, Boolean) -> Boolean
brillhartIrreducible?(p, noLinears)
returnstrue
ifp
can be shown to be irreducible by a remark of Brillhart,false
else. If noLinears istrue
, we are being toldp
has no linear factorsfalse
does not mean thatp
is reducible.
- brillhartIrreducible?: UP -> Boolean
brillhartIrreducible?(p)
returnstrue
ifp
can be shown to be irreducible by a remark of Brillhart,false
is inconclusive.
- brillhartTrials: () -> NonNegativeInteger
brillhartTrials()
returns the number of tests in brillhartIrreducible?.
- brillhartTrials: NonNegativeInteger -> NonNegativeInteger
brillhartTrials(n)
sets ton
the number of tests in brillhartIrreducible? and returns the previous value.
- noLinearFactor?: UP -> Boolean
noLinearFactor?(p)
returnstrue
ifp
can be shown to have no linear factor by a theorem of Lehmer,false
else.I
insist on the fact thatfalse
does not mean thatp
has a linear factor.