I'm sure a lot of people are aware of the 3x+1 conjecture ( a quick recap: take a positive integer, strip powers of 2 off it until it is odd, multiply 3 and add 1. Repeat. Conjecturally, this always gives 1 after a finite number of iterations.) A lot of work has been done on this conjecture. Jeffrey Lagarias has a detailed survey article that is available on the Arxiv. Somehow, this problem seems not to have captured the imagination of the mathematical mainstream. Maybe everyone believes that such problems are intractable (or at least, as Erdos warned, beyond the current state-of-the-art.) I would like a suggest a highly speculative and half-baked approach which, if nothing else, betrays the fact I am obsessed with modularity and tend to look for it in places where it probably doesn't belong! Apologies in advance for what might be a waste of your time.
There are two ways the conjecture might be false:
- Starting with an odd integer $x_0$, successive iterations produce a divergent sequence of odd integers $x_1$, $x_2$...
- Starting with an odd integer $x_0 \neq 1$, we get back to $x_0$ after a finite number of iterations. (The sequence would then be $x_0, x_1, x_2, ..., x_n = x_0$ for some $n$.)
For each situation we construct the following family of elliptic curves:
$y^2 = x(x-x_i)(x + x_{i+1}) $, $i = 0, 1, 2....$
Is it possible that either of the above situations will give us a family of elliptic curves with a member that is not modular? If at all this idea has potential, the second situation would be the one to consider initially since it will involve a finite number of elliptic curves.

