I have to say, I'm pretty impressed that you got the first one pretty easily - it took me longer than I liked.
The second was trivial - which I also found interesting, that you found it harder.
The third has been interesting... I've gotten a nonexistent answer ("and then plug 4 into the function that, for n an integer, f(n) returns the nth prime" (2, 3, 5, 7 - 7 is the fourth prime. And I can get to 48 pretty easily. But there's no way I can legitimately claim it's "any of a broad set of mathematical operators". Such a function *exists* - primes are well defined, and well ordered. But it's not a common function.)
![[personal profile]](https://www.dreamwidth.org/img/silk/identity/user.png){kind=small}
no subject
Date: 2009-11-25 03:59 pm (UTC)The second was trivial - which I also found interesting, that you found it harder.
The third has been interesting... I've gotten a nonexistent answer ("and then plug 4 into the function that, for n an integer, f(n) returns the nth prime" (2, 3, 5, 7 - 7 is the fourth prime. And I can get to 48 pretty easily. But there's no way I can legitimately claim it's "any of a broad set of mathematical operators". Such a function *exists* - primes are well defined, and well ordered. But it's not a common function.)