diff --git a/main.cpp b/main.cpp
index 50fc2b7..7e83ef8 100644
--- a/main.cpp
+++ b/main.cpp
@@ -1,32 +1,11 @@
-#include <algorithm>
-#include <cmath>
 #include <iostream>
 
-// return true if the difference between a and b is within epsilon percent of the larger of a and b
-bool approximatelyEqualRel(double a, double b, double relEpsilon)
-{
-	return (std::abs(a - b) <= (std::max(std::abs(a), std::abs(b)) * relEpsilon));
-}
-
-bool approximatelyEqualAbsRel(double a, double b, double absEpsilon, double relEpsilon)
-{
-    // Check if the numbers are really close -- needed when comparing numbers near zero.
-    double diff{ std::abs(a - b) };
-    if (diff <= absEpsilon)
-        return true;
-
-    // Otherwise fall back to Knuth's algorithm
-    return (diff <= (std::max(std::abs(a), std::abs(b)) * relEpsilon));
+std::string* test() {
+    static std::string tr {"test"};
+    return &tr;
 }
 
 int main()
 {
-    // a is really close to 1.0, but has rounding errors
-    double a{ 0.1 + 0.1 + 0.1 + 0.1 + 0.1 + 0.1 + 0.1 + 0.1 + 0.1 + 0.1 };
-
-    std::cout << approximatelyEqualRel(a, 1.0, 1e-8) << '\n';     // compare "almost 1.0" to 1.0
-    std::cout << approximatelyEqualRel(a-1.0, 0.0, 1e-8) << '\n'; // compare "almost 0.0" to 0.0
-
-    std::cout << approximatelyEqualAbsRel(a, 1.0, 1e-12, 1e-8) << '\n'; // compare "almost 1.0" to 1.0
-    std::cout << approximatelyEqualAbsRel(a-1.0, 0.0, 1e-12, 1e-8) << '\n'; // compare "almost 0.0" to 0.0
+    std::cout << *test();
 }