I was looking into various Computer Science study offerings and I discovered the topic of Discrete mathematics: proof by contradiction.

After seeing an introduction about this, I thought this could prove very useful to modern-day projects, for example: a project where millions of pdf's per minute have to be processed using an extraction algorithm. Seeing this would take long as it traverses through the data (depending on the algorithm), I can see the usefulness of proof by contradiction as a speedy algorithm here: the algorithm would just have to prove the negation and be done instead of having to traverse through the tree many more times.