Find $gcd(31415,14142)$ by applying Euclid's algorithm.

Compare the order of growth for the following functions:

a$.x^2$ and $lnx$

b$.x^2$ and $e^x$

c$.3^x$ and $2^x$

d$.lnx$ and $x^{\frac{1}{n}}$

How many comparisons $($both successful and unsuccessful$)$ will be made by the bruteforce algorithm in searching for each of the following patterns in the binary text of one thousand zeros? a$.00001$ b$,10000$ c$.01010$

I just want answers, I don't want an explanation $.$