Grant, your divisible series should become a challenge by its own right.
Thanks for the vote. We'll see if the Cody team agrees. I just added a few more problems to the series today to round it out.
Nice problem - deceptively tricky.
my solution is failing because when the numbers are very large it gets confused by the "eXX" where XX is the exponent associated with the test number.
Can i get help on how to avoid this?
You need to find a way to operate on the string, which may involve mathematical operations on small portions of the string, bit by bit, converting small portions of the string to a number, in an iterative fashion, etc., based on the method you choose. str2num() is subject to loss of precision for very large numbers and will not work for at least one test case in essentially all of these problems (by design).
Is my wife right? Now with even more wrong husband
Project Euler: Problem 3, Largest prime factor
Divisible by 9
Divisible by 10
Recaman Sequence - II
5 Prime Numbers
Approximation of Pi (vector inputs)
Lights Out 10 - 5x5, with wrapping, 6 moves
Stress-Strain Properties - 5
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