How does O$($n$^$log$($phi$)/$ sqrt $(5))$ becomes O$($logn$)$ for the Elucidian's Algorithm for computing GCD$?$