# MachineIntegerΒΆ

A domain which models the integer representation used by machines in the AXIOM-NAG link.

0: %

from AbelianMonoid

1: %

from MagmaWithUnit

*: (%, %) -> %

from LeftModule %

*: (Integer, %) -> %

from AbelianGroup

*: (NonNegativeInteger, %) -> %

from AbelianMonoid

*: (PositiveInteger, %) -> %

from AbelianSemiGroup

+: (%, %) -> %

from AbelianSemiGroup

-: % -> %

from AbelianGroup

-: (%, %) -> %

from AbelianGroup

<=: (%, %) -> Boolean

from PartialOrder

<: (%, %) -> Boolean

from PartialOrder

=: (%, %) -> Boolean

from BasicType

>=: (%, %) -> Boolean

from PartialOrder

>: (%, %) -> Boolean

from PartialOrder

^: (%, NonNegativeInteger) -> %

from MagmaWithUnit

^: (%, PositiveInteger) -> %

from Magma

~=: (%, %) -> Boolean

from BasicType

abs: % -> %

from OrderedRing

addmod: (%, %, %) -> %
annihilate?: (%, %) -> Boolean

from Rng

antiCommutator: (%, %) -> %
associates?: (%, %) -> Boolean

from EntireRing

associator: (%, %, %) -> %
base: () -> %
binomial: (%, %) -> %
bit?: (%, %) -> Boolean
characteristic: () -> NonNegativeInteger
coerce: % -> %

from Algebra %

coerce: % -> OutputForm
coerce: Expression Integer -> Expression %

`coerce(x)` returns `x` with coefficients in the domain

coerce: Integer -> %
commutator: (%, %) -> %
convert: % -> DoubleFloat
convert: % -> Float
convert: % -> InputForm
convert: % -> Integer
convert: % -> Pattern Integer
copy: % -> %
D: % -> %

from DifferentialRing

D: (%, NonNegativeInteger) -> %

from DifferentialRing

dec: % -> %
differentiate: % -> %

from DifferentialRing

differentiate: (%, NonNegativeInteger) -> %

from DifferentialRing

divide: (%, %) -> Record(quotient: %, remainder: %)

from EuclideanDomain

euclideanSize: % -> NonNegativeInteger

from EuclideanDomain

even?: % -> Boolean
expressIdealMember: (List %, %) -> Union(List %, failed)
exquo: (%, %) -> Union(%, failed)

from EntireRing

extendedEuclidean: (%, %) -> Record(coef1: %, coef2: %, generator: %)

from EuclideanDomain

extendedEuclidean: (%, %, %) -> Union(Record(coef1: %, coef2: %), failed)

from EuclideanDomain

factor: % -> Factored %
factorial: % -> %
gcd: (%, %) -> %

from GcdDomain

gcd: List % -> %

from GcdDomain

gcdPolynomial: (SparseUnivariatePolynomial %, SparseUnivariatePolynomial %) -> SparseUnivariatePolynomial %

from GcdDomain

inc: % -> %
init: %

from StepThrough

invmod: (%, %) -> %
latex: % -> String

from SetCategory

lcm: (%, %) -> %

from GcdDomain

lcm: List % -> %

from GcdDomain

lcmCoef: (%, %) -> Record(llcm_res: %, coeff1: %, coeff2: %)

from LeftOreRing

leftPower: (%, NonNegativeInteger) -> %

from MagmaWithUnit

leftPower: (%, PositiveInteger) -> %

from Magma

leftRecip: % -> Union(%, failed)

from MagmaWithUnit

length: % -> %
max: (%, %) -> %

from OrderedSet

maxint: () -> PositiveInteger

`maxint()` returns the maximum integer in the model

maxint: PositiveInteger -> PositiveInteger

`maxint(u)` sets the maximum integer in the model to `u`

min: (%, %) -> %

from OrderedSet

mulmod: (%, %, %) -> %
multiEuclidean: (List %, %) -> Union(List %, failed)

from EuclideanDomain

negative?: % -> Boolean

from OrderedRing

nextItem: % -> Union(%, failed)

from StepThrough

odd?: % -> Boolean
one?: % -> Boolean

from MagmaWithUnit

opposite?: (%, %) -> Boolean

from AbelianMonoid

patternMatch: (%, Pattern Integer, PatternMatchResult(Integer, %)) -> PatternMatchResult(Integer, %)
permutation: (%, %) -> %
plenaryPower: (%, PositiveInteger) -> %
positive?: % -> Boolean

from OrderedRing

positiveRemainder: (%, %) -> %
powmod: (%, %, %) -> %
prime?: % -> Boolean
principalIdeal: List % -> Record(coef: List %, generator: %)
quo: (%, %) -> %

from EuclideanDomain

random: % -> %
rational?: % -> Boolean
rational: % -> Fraction Integer
rationalIfCan: % -> Union(Fraction Integer, failed)
recip: % -> Union(%, failed)

from MagmaWithUnit

rem: (%, %) -> %

from EuclideanDomain

retract: % -> Integer
retractIfCan: % -> Union(Integer, failed)
rightPower: (%, NonNegativeInteger) -> %

from MagmaWithUnit

rightPower: (%, PositiveInteger) -> %

from Magma

rightRecip: % -> Union(%, failed)

from MagmaWithUnit

sample: %

from AbelianMonoid

shift: (%, %) -> %
sign: % -> Integer

from OrderedRing

sizeLess?: (%, %) -> Boolean

from EuclideanDomain

smaller?: (%, %) -> Boolean

from Comparable

squareFree: % -> Factored %
squareFreePart: % -> %
submod: (%, %, %) -> %
subtractIfCan: (%, %) -> Union(%, failed)
symmetricRemainder: (%, %) -> %
unit?: % -> Boolean

from EntireRing

unitCanonical: % -> %

from EntireRing

unitNormal: % -> Record(unit: %, canonical: %, associate: %)

from EntireRing

zero?: % -> Boolean

from AbelianMonoid

AbelianGroup

AbelianMonoid

AbelianSemiGroup

BasicType

BiModule(%, %)

CancellationAbelianMonoid

canonicalUnitNormal

CharacteristicZero

CombinatorialFunctionCategory

CommutativeRing

CommutativeStar

Comparable

DifferentialRing

EntireRing

EuclideanDomain

FortranMachineTypeCategory

GcdDomain

IntegerNumberSystem

IntegralDomain

LeftOreRing

Magma

MagmaWithUnit

Monoid

multiplicativeValuation

NonAssociativeRing

NonAssociativeRng

NonAssociativeSemiRing

NonAssociativeSemiRng

noZeroDivisors

OrderedAbelianGroup

OrderedAbelianMonoid

OrderedAbelianSemiGroup

OrderedCancellationAbelianMonoid

OrderedIntegralDomain

OrderedRing

OrderedSet

PartialOrder

PrincipalIdealDomain

RealConstant

Ring

Rng

SemiGroup

SemiRing

SemiRng

SetCategory

StepThrough

TwoSidedRecip

UniqueFactorizationDomain

unitsKnown