Pointless 2.0

#1

Implement

  int s(int a,int b,int c)

so s returns the sum of all multiples of a or b below c. For example s(3,5,10) would return 23.
You may assume 0<a<b<c<=1000
#2

Implement

  int s(int m)

so s returns the sum of all even valued terms in the Fibonacci sequence whose values do not exceed m.
You may assume 0<m<1000.

#3

Implement

  int p(int n)

so p returns the n'th prime. p(1) == 2, p(2) == 3 etc. You may assume 0<n<1000.


#4

TBD