contravariant

990 ms·

3691.
by contravariant 12y ago
That's not really an optimal way to check divisibility though, if you want to be quick try: fizz = (uint)i*2863311531 <= (uint)i; buzz = (uint)i*3435973837 <= (uint)i; Should work for fine for i<=1000. Edit: chang
3692.
by contravariant 12y ago
Perhaps a combination of boolean logic and set theory? For instance let X be the set of possible dates and let m, d, be functions which, respectively, return the month and the day of any date in X. Now the three statements can be translated
3693.
by contravariant 12y ago
This is most definitely math, it is more related to logic than geometry / calculus though so the mathematics behind it might be somewhat unfamiliar to you if you haven't followed any logic oriented courses.
3694.
by contravariant 12y ago
I think that could be avoided by making sure that large parts of the signatures overlap. There's probably some scheme to be able to recover which copies were used to make the leaked copy (up to some finite number of copies, but it quic
3695.
by contravariant 12y ago
Doesn't the existence of multiple LUAs contradict either the word 'last' or the word 'universal'?
3696.
by contravariant 12y ago
They're not saying that there's only one universal ancestor only that of all the universal ancestors, one must have been the most recent. Which is almost certainly true, if in fact there exists a universal ancestor. Perhaps you me
3697.
by contravariant 12y ago
From his claim that sick_days = -52 ln(x) + 236 It would be more straightforward to conclude that the number of sick days is exponentially distributed. To see this first note that the employee index "x" is equal to N(1 -
3698.
by contravariant 12y ago
That vector space would be the real numbers.
3699.
by contravariant 12y ago
If you approximate the positions of the pin numbers as independent exponential distributions with parameter λ = 1/10000. Then the expected value of the maximum is the sum of 10000/k for k = 1 to 10000 [1], which is approximately 1