@FreakEnum first of all, 3 does not divide 98, second of all we wanted numbers that are divisible by all three numbers and 3 is way too small to be divisible by even one of them.
"the atleast one"? If you mean the least one, that would be 1, but what's the point? And if you mean at least one, then of course, but again what's the point?
in order to count the number of #s divisble by at least one of three numbers a, b, c less than a given n, you need to define S(m) to be the set of all multiples of m less than the given number n, then compute |S(a)|+|S(b)|+|S(c)|-|S(gcd(a,b))|-|S(gcd(a,c))|-|S(gcd(b,c))|+|S(gcd(a,b,c))|, or something roughly like that I believe...
Well, it's like [0,1]x[0,1]x... except uncountably many in the product. Instead of making the component index an element of N make it an element of [0,1] and viola
@QED You asked me why I said "No?", sorry. I thought it was a rhetorical question. I said that because I think the answer should be "no" but I'm not sure enough to say it without a question mark.
a full page ad in a recent SciAm begins, first sentence: "Artificial Intelligence (AI) is the quest to achieve comuters [sic] that equal or exceed human performance on complex intellectual tasks." I thought that was ironic.