## Naive Approach to Solution

- Brute Force
- Check all the possible series that end with n+1, then those that end with n+2 , then those that end with n+3.
- Very inefficient. (exponential complexity)

Graham's Function | Finding Graham's Function Using Perl | #2 |

- Brute Force
- Check all the possible series that end with n+1, then those that end with n+2 , then those that end with n+3.
- Very inefficient. (exponential complexity)

Copyright © 2005 Shlomi Fish |