Write a program that calculates the sums of multiples of 3 or 5 between zero and a given maximum value. For example, if the maximum is 30, then the program should calculate 3 + 5 + 6 + 9 + 10 + 12 + 15 + 18 + 20 + 21 + 24 + 25 + 27 + 30 = 225 because those are the multiples of 3 and 5.
- Title Page
- Copyright and Credits
- Dedication
- Packt Upsell
- Contributors
- Preface
- Mathematics
- Problems
- 1. Statistical functions
- 2. Permutations
- 3. Combinations
- 4. Factorials
- 5. Fibonacci numbers
- 6. Binomial coefficients
- 7. Pascal's triangle
- 8. Greatest common divisors
- 9. Least common multiples
- 10. Sums of multiples
- 11. Primality testing
- 12. Prime table
- 13. Prime factors
- 14. Unique prime factors
- 15. Prime tuples
- 16. Proper divisors
- 17. Amicable numbers
- 18. Perfect numbers
- 19. Armstrong numbers
- Solutions
- 1. Statistical functions
- 2. Permutations
- 3. Combinations
- 4. Factorials
- 5. Fibonacci numbers
- 6. Binomial coefficients
- 7. Pascal's triangle
- 8. Greatest common divisors
- 9. Least common multiples
- 10. Sums of multiples
- 11. Primality testing
- 12. Prime table
- 13. Prime factors
- 14. Unique prime factors
- 15. Prime tuples
- 16. Proper divisors
- 17. Amicable numbers
- 18. Perfect numbers
- 19. Armstrong numbers
- Problems
- Geometry
- Problems
- 20. Monte Carlo π
- 21. Newton's π
- 22. Bisection root-finding
- 23. Newton's method
- 24. Gaussian elimination
- 25. Monte Carlo integration
- 26. Rectangle rule integration
- 27. Trapezoid rule integration
- 28. Arrowheads
- 29. Line-line intersection
- 30. Point-line distance
- 31. Point-segment distance
- 32. Segment-segment distance
- 33. Circle selection
- 34. Line-circle intersection
- 35. Circle-circle intersection
- 36. Circle-line tangents
- 37. Polygon area
- 38. Point in a polygon
- 39. Convexity testing
- 40. Stars
- Solutions
- 20. Monte Carlo π
- 21. Newton's π
- 22. Bisection root-finding
- 23. Newton's method
- 24. Gaussian elimination
- 25. Monte Carlo integration
- 26. Rectangle rule integration
- 27. Trapezoid rule integration
- 28. Arrowheads
- 29. Line-line intersection
- 30. Point-line distance
- 31. Point-segment distance
- 32. Segment-segment distance
- 33. Circle selection
- 34. Line-circle intersection
- 35. Circle-circle intersection
- 36. Circle-line tangents
- 37. Polygon area
- 38. Point in a polygon
- 39. Convexity testing
- 40. Stars
- Problems
- Dates and Times
- Randomization
- Strings
- Files and Directories
- Advanced C# and .NET Features
- Simulations
- Cryptography
- Other Books You May Enjoy
10. Sums of multiples
-
No Comment
..................Content has been hidden....................
You can't read the all page of ebook, please click here login for view all page.