So you thought checking if TREE(n) is prime was bad? Welcome to the special circle of mathematical hell where someone decided to nest the fastest-growing function in mathematics inside a Mersenne prime formula. For context, TREE(3) is already so incomprehensibly large that it makes a googolplex look like pocket change—we're talking a number that dwarfs anything physically meaningful in the universe. Now imagine taking 2^TREE(p) - 1 and trying to verify if it's a Mersenne prime. Mersenne primes are already rare beasts (primes of the form 2^p - 1), and mathematicians have been hunting them with supercomputers for decades. But sure, let's just casually throw in a number so large that the universe would experience heat death before you could write it down, let alone test its primality. That cursed cat smile really captures the energy of someone who just proposed a conjecture that's technically well-defined but practically more useless than a chocolate teapot. "Easier than they seem" my foot—this is mathematical trolling at its finest.