HN user

cpchen

16 karma
Posts0
Comments9
View on HN
No posts found.

The classic recurrence is if you're choosing K elements out of N, it either has the first element (in which case you choose K-1 elements out of the remaining N-1) or it doesn't (in which case you choose K elements out of the remaining N-1), so:

N choose K = (N-1 choose K-1) + (N-1 choose K).

Also, if you sum (N choose K) for all values of K you get 2^N.

Spaced repetition 10 years ago

I don't have any studies, but check the wikipedia page for examples of Memory Championship winners using the method to, for example, memorize a deck of shuffled cards or a random sequence of digits. I bet Moonwalking with Einstein would have some references in the scientific literature.