(a, b, c) = decomposeFraction(p, t)
Given a rational number $t$ and a prime $p$, decomposeFraction(p, t) returns a sequence ($a$,$b$,$c$) of integers, with $b$ and $c$ nonnegative, such that $t = a/(p^b(p^c1))$.


If the number $t$ is of the form $a/p^b$, then the function returns ($a$,$b$,$0$). Setting the option NoZeroC => true forces the third entry of the output sequence to be nonzero, even if that means increasing the first entry.



The object decomposeFraction is a method function with options.