Click here to Skip to main content
15,745,569 members
Please Sign up or sign in to vote.
1.00/5 (1 vote)
a function sum_of_digits(a,b), that takes two arguments a and b, computes a to the power of b, then recursively finds the sum of digits until there is only one digit left. 
for example sum_digits(5,2) return 5ˆ2=25=2+5=7

What I have tried:

I tried two methods but none of them work recursively
Updated 11-Dec-20 2:10am
Richard Deeming 11-Dec-20 7:33am    
Nobody is going to do your homework for you.
Patrice T 11-Dec-20 7:56am    
Show your code and explain how it fail.

Suppose your recursive function would be add_digits(n) then, the stop condition is n<10. If the stop condition is met than the function returns its argument.
On the other hand, if the stop condition is not met then add_digits returns the sum of (n%10) with the result of add_digits(n/10).
Share this answer
We are more than willing to help those that are stuck: but that doesn't mean that we are here to do it all for you! We can't do all the work, you are either getting paid for this, or it's part of your grades and it wouldn't be at all fair for us to do it all for you.

So we need you to do the work, and we will help you when you get stuck. That doesn't mean we will give you a step by step solution you can hand in!
Start by explaining where you are at the moment, and what the next step in the process is. Then tell us what you have tried to get that next step working, and what happened when you did.

Hint: the % operator can extract the least significant digit, and the / operator can remove it ...

If you are having problems getting started at all, then this may help: How to Write Code to Solve a Problem, A Beginner's Guide[^]
Share this answer

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

CodeProject, 20 Bay Street, 11th Floor Toronto, Ontario, Canada M5J 2N8 +1 (416) 849-8900