This series reminded me of a Numberphile video: https://youtu.be/vNTSugyS038
It is a good idea to apply an upper bound! It seems that the upBound becomes an underestimate of the upper bound for test case 2.
Yes, I was looking for something cody-friendly :). I forgot it works in this form iff gcd(n(1),n(2))==1.
Bottles of beer
Sum of first n terms of a harmonic progression
Generate N equally spaced intervals between -L and L
Subtract two positive numbers
Simple return on investment
Sums of Distinct Powers
Golomb's self-describing sequence (based on Euler 341)
Sleeping Queens 1
Pandigital Multiples of 11 (based on Project Euler 491)
Numbers in extended form
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