Problem 1. The exponential of a number x by a power n, represented as x, can eas

Question

Problem 1. The exponential of a number x by a power n, represented as x, can easily be calculated using a repeated multiplication process, so that x-x*x*...*x, n times. n indicates the number of times x has to be multiplied. Question 1. Give the Algorithm that can be used for calculating the exponential using multiplications multiplication using this method. returns the exponential value as follows. 2. Give the corresponding flow diagram that describes the steps needed to calculate the 3. Write a function in Arduino C that is called exp and receives the values of x and n and y-exp(x, n); Problem 2. Write a function in C that returns the factorial of a number n as follows: z-fact(n); Modulo of two integer numbers uas follows: Remainder Mod(A,B);

Explanation / Answer

2. Recursive function for factorial..

int fact(int n) {

If(n==1)

return 1;

else

return n*fact(n-1);

}

Please post other questions seperately... Thanx

Related Questions

Navigate

• Browse (All)
• Browse P
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.