Project Euler - Problem 1 - Multiples of 3 and 5

&#xA; Problem 1 - Multiples of 3 and 5&#xA; &#xA; &#xA; Link to heading &#xA; &#xA; &#xA; The problem statement asks to find the sum of all multiples of 3 and 5 not greater than 1000. &#xA; &#xA; Bruteforcing solution&#xA; &#xA; &#xA; Link to heading &#xA; &#xA; &#xA; To bruteforce the solution it is enough to generate a list of multiples, prevent double counting and then perform the sum. In order…