Well, when it comes to math, I gotta admit, I'm not the smartest cookie in the cookie jar, but if you take 20 2/5 and divide it by 2/5, you should be left with the number of sheets of sheetrock there are in the stack. To divide it, you my have to convert the fraction to a decimal, just FYI. Considering this is marked as a college-level question, I assume you already know how to do this. Hope this helps ya, pal.
Answer:
int t(int n){
if(n == 1)
return 1;
else
return n*n*t(n-1);
}
Step-by-step explanation:
A recursive function is a function that calls itself.
I am going to give you an example of this algorithm in the C language of programming.
int t(int n){
if(n == 1)
return 1;
else
return n*n*t(n-1);
}
The function is named t. In the else clause, the function calls itself, so it is recursive.
Answer:
I don't know
I don't know
I don't know and this is it easy see!
15 is the nearest whole number to that number
