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

#### Searching for a Shelter in the Dark.

A dark rainy night… Your car is at a crossroads with paths leaving. You know, there is a city somewhere on a road, but you don’t know on which one, neither the distance to it. 743 more words

#### A tiling problem

Here is a problem given at VIII International Festival of Young Mathematicians Sozopol (an old sea town of Bulgaria), 2017. It was published recently in… 850 more words

## The Wurzelbrunft’s Conjecture is a very powerful tool, so it cannot be true!

In the previous two parts, I’ve discussed about -problems and vs. question. 724 more words

## Wurzelbrunft’s Conjecture.

In the previous post we’ve covered what “NP problems” means. Here, we proceed with the Wurzelbrunft’s conjecture. I hadn’t heard nothing about Wurzelbrunft’s conjecture, till the moment I’ve heard of the bank of Bath. 580 more words

## 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