- Consider and . Using the Euclidean division, compute a -adic expansion of
- For the general case, design an algorithm that computes a -adic expansion of .
- Give an upper bound for the time complexity of this algorithm, counting the number of operations in .
- Show that admits one and only one -adic expansion.

*
*

2008-03-18