Another Normie Function defined as f(n)= f(n-1)+f(n-2)+f(n-3) , when n>3 and 1 , when n<=3. Find the nth term of this function .
Please add more tests to deter hardcoded solutions (see Solution 1472301).
Great use of recursion. Unfortunately, this solution should fail the updated test suite due to performance (time out) for cases n>36;
Thanks for the tip off. By the way, it turns out that in the updated Test Suite there is an inherent imprecision (or 'tolerance') of about ±64 in the stated 'correct' result for n=70: see Solution 1528518. On the other hand, you could enforce exact solutions even for n=70 as suggested in Solution 1528517 (like Problem 44628). —DIV
In the code f(1), f(2) & f(3) are defined, but never used.
David Verrelli, yes, they are never used. I forgot to remove those lines. Thanks!
Back and Forth Rows
sum of non-primes
What number has this problem?
Array of Ones
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office