ModInts example: use invmod instead of gcdx

Ref: 331eb3f
incubator · Oct 5, 2014 · 7dd704b · 7dd704b
1 parent 0388647
commit 7dd704b
Showing 1 changed file with 2 additions and 5 deletions.
diff --git a/examples/modint.jl b/examples/modint.jl
@@ -17,9 +17,6 @@ Base.promote_rule{n}(::Type{ModInt{n}}, ::Type{Int}) = ModInt{n}
 Base.show{n}(io::IO, k::ModInt{n}) = print(io, "$(k.k) mod $n")
 Base.showcompact(io::IO, k::ModInt) = print(io, k.k)
 
-function Base.inv{n}(a::ModInt{n})
-    thegcd, x = gcdx(a.k, n)
-    thegcd==1 ? ModInt{n}(x) : error("Inverse of $(a.k) mod $n doesn't exist")
-end
-
+Base.inv{n}(a::ModInt{n}) = ModInt{n}(invmod(a.k, n))
+
 end # module