# Talk:T m(x) = (+/-)T n(x)

From Polymath1Wiki

The cases Tm(x)=±Tn(x)=±x and C=2 are providing some interesting structure when the values of m and n are primes (2 and 5 were a good choice, and 11 and 13 got added to the mix). It is also possible to add other constraints of the form Tr(x)=±Ts(x) for primes r and s. What seems to happen is that the values on Tp(x) for other (unconstrained) primes adapt themselves to make the sequence work. So with the example sequence of length 854 this happens for the primes 3 and 7. It would be interesting to understand what would make a good set of primes to constrain, and whether there is any reason that particular choices of sign work well.