Given the exercise
Firstly show that the variable h has (with respect to basis 2) less digits than k. Then conclude that the euclidean algorithm is (ends) in polynomial time in .
I don't find a meaningful beginning. I can write as a representation of k in the dual System. Then
Ok that far. Now what is here the idea? I don't see a track honestly ...