Call a positive number groovy if it can be writen in the form √(n)+√(n+1) for some positive integer n. Show that if x is groovy then for any positive integer r, the number x^r is groovy as well.