1. Write a program that converts an integer (base 10) into (i) binary and
(ii) octal numbers
2. Write a program to compute cube root of a number x using the fact that
if p is an approximation for cube root of X then q = (2p+x/(p*p))/3 is a
better one.
3. Write a program to print all prime numbers between 2 and n. Count the
number of times the loop(s) iterate. Can you reduce this number?