Feeds
질문
Help I need to convert numbers into English words using recursion
I have to convert positive integers from one to 999,999,999 into English words. It would be easy if I didn't need to use recurs...
대략 8년 전 | 답변 수: 1 | 0
1
답변질문
Help, secant method by recursion
I'm trying to write a function that uses the secant method to find a root of the function. I'm required to write both the ite...
대략 8년 전 | 답변 수: 2 | 0
2
답변질문
How to find next Pythagorean prime
After reading a number from the keyboard, I need to find the next Pythagorean prime that can be expressed as 4n-1 and as the sum...
8년 초과 전 | 답변 수: 1 | 0
