I’ve come across some Olympiad problems, which are easily solved via finite differences and its basic properties.
I’ll illustrate it with two problems (for now being). 484 more words
Tags » Math Olympiads
First things first.
“NP” stands for “Non deterministic Polynomial time”. It denotes the class of computational problems for which a candidate for a solution can be verified in polynomial time (of the input). 824 more words