Number.Root

Documentation

data T a

The root degree must be positive. This way we can implement multiplication using only multiplication from type a.

Constructors

Cons Integer a

Instances

Functor T

When you use fmap you must assert that forall n. fmap f (Cons d x) == fmap f (Cons (n*d) (x^n))

Defined in Number.Root

Methods

fmap :: (a -> b) -> T a -> T b

(<$) :: a -> T b -> T a

(Eq a, C a) => Eq (T a)

Defined in Number.Root

Methods

(==) :: T a -> T a -> Bool

(/=) :: T a -> T a -> Bool

(Ord a, C a) => Ord (T a)

Defined in Number.Root

Methods

compare :: T a -> T a -> Ordering

(<) :: T a -> T a -> Bool

(<=) :: T a -> T a -> Bool

(>) :: T a -> T a -> Bool

(>=) :: T a -> T a -> Bool

max :: T a -> T a -> T a

min :: T a -> T a -> T a

Show a => Show (T a)

Defined in Number.Root

Methods

showsPrec :: Int -> T a -> ShowS

show :: T a -> String

showList :: [T a] -> ShowS

fromNumber :: a -> T a

toNumber :: C a => T a -> a

toRootSet :: C a => T a -> T a

commonDegree :: C a => T a -> T a -> T (a, a)

mul :: C a => T a -> T a -> T a

div :: C a => T a -> T a -> T a

recip :: C a => T a -> T a

cardinalPower :: C a => Integer -> T a -> T a

exponent must be non-negative

integerPower :: C a => Integer -> T a -> T a

exponent can be negative

rationalPower :: C a => Rational -> T a -> T a

root :: C a => Integer -> T a -> T a

exponent must be positive

sqrt :: C a => T a -> T a