Your solution is almost correct but your removing duplicates at multiples of the product of mult1 & mult2. You may actually find duplicates at multiples of less than that product.
Oops! I knew I was forgetting something! Thanks for the tip Ramon.
Finding Perfect Squares
Count from 0 to N^M in base N.
Combinations without using nchoosek
Easy Sequences 14: Consecutive Composites
Easy Sequences 8: Triangles with integer sides and prime perimeters
Easy Sequences 20: Counting Prime-sided Rectangles
Easy Sequence 61: Wide Pythagorean Triangles
Easy Sequences 10: Sum of Cumsums of Fibonacci Sequence
Find the treasures in MATLAB Central and discover how the community can help you!
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