Many things in math can be formulated quite differently; see the list of statements equivalent to RH here, for example, with RH formulated as a bound on lcm of consecutive integers, as an integral equality, etc.

I wonder about equivalent formulations of the N vs. NP problem. Formulations that are very much different from the questions such "Is TSP in P?", formulation that may seem unrelated to complexity theory.