[−][src]Trait maths_traits::algebra::ring_like::Divisibility
Common methods regarding multiplicative inverses in a ring or semiring
Do note that while for some rings these methods are relatively quick (like the integers), for others, such as polynomials, this test might actually be relatively expensive
Required methods
fn divides(self, rhs: Self) -> bool
Determines if there exists an element x
such that self*x
= rhs
fn divide(self, rhs: Self) -> Option<Self>
Finds an element x
such that self*x
= rhs
if such an element exists
fn unit(&self) -> bool
Determines if this element has a multiplicative inverse
fn inverse(self) -> Option<Self>
Finds this element's multiplicative inverse if it exists