Follow your curiosity

What discovery has been shared with you?

FACTREE gives you something interesting to discover every day — and something worth talking about together.

Start with one fact. Explore it, go deeper, then follow whichever branch catches your imagination.

Choose subjects for a surprise

Exploring any topic

Begin your discovery

Your next discovery is one click away.

Choose one or more subjects above, or leave Any Topic selected and let curiosity decide.

Mathematics

Computational Complexity and the Classes P and NP

Quick fact

No one knows whether P equals NP, but if P = NP, then every problem whose solution can be quickly verified could also be quickly solved—potentially breaking modern encryption and solving countless optimization puzzles instantly.

Why this is interesting

Some problems are easy for a computer to solve, and others seem impossible—even with the fastest supercomputers. What makes a problem 'easy' or 'hard'?