Write in pseudo code the recursive function which receive 2 integers (a and b) and returns sum of all common prime dividers (1 is not prime). For example:
a = 48, b = 60
48=2*2*2*2*3
60=2*2*3*5
The function returns 7=2+2+3
If we write all the natural numbers below 10 which are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23. Determine the sum of all multiples of 3 or 5 below 1000. What is the right answer?