102 karma · joined March 31, 2020
How?
(I made up the exact numbers, but the idea is there.)
That seems like a meaningful interpretation of "600 points" that applies to anyone -- though the difficulty of actually making this improvement definitely varies with your starting rating.
> A piece of information you may or may not want us to find about is your email address....
> [email address box] Subscribe Free
I agree that programming languages, it can mean various things, just like < and > mean different things in C++ vs bash vs drawing arrows.
Is it possible that you misinterpreted this as a post about << and >> in code rather than their usage in mathematics?
Kind of funny that your hypothetical example was exactly reality in this case.
I'm a bit confused, I thought any string with only lowercase letters was "valid base64" (more precisely, I thought "valid base64" is equivalent to "string consists only of the 64 special characters we're using to represent digits 0-63").
This is still pretty specific to counting paths in the same way the original knight problem is, though.
The other comment is talking about how you represent each state for the recursive function as a vertex, then connect it to its dependencies (basically taking the recursion tree, but merging identical calls).
I mean, this is just because most people have 1-2 income sources and way more expense sinks, so this is just rhetoric.
I don't think this implies a problem with "your current password" security, just that you don't care if the hackers have the password that they set themselves (and clearly already know then).
Because of the way the recursion goes down the tree depth-first, I think 5 basically cuts down the computation to fib(10-5) = fib(5) which is pretty manageable, so the author couldn't really see any further measurable performance gains by increasing the cache further. I think for fib(35) it'd be clear that cache size 35 would help compared to cache size 5. (I picked 35 instead of, say, 300, because I think 300 would just not finish with cache size 5, it'd take forever haha.)
Try it with fib(35), curious what you find.
For example, if you already know x == 3 and your original "assumption" (not a great word choice here) is "x < 5 OR x > 20", you can simplify that to "3 < 5 OR 3 > 20" and then to "True OR False" and then the boolean literal "True", so you know the original expression "x < 5 OR x > 20" is True.
That's my best guess, at least.