One key realization is that the length of the chain of the product of two odd numbers t(n *m) = t(n) + t(m) -2. Morover t(p) = 1 + t(p-1) and t(2^k) = k + 1. All possible products of prime which are part of the set and lengths of their totient chain and totient chain frequencies can be calculated using polyomials. Finding this polynomial is the most difficult part. This polynomials is the product of two polynomials. First one is for odd primes and the second one is for all multiplications of powers of 2. We need to find efficient way to multiplying and powering polynomials. It can be done using fft. The freqencies of the given length totient chain are coefficient of this polynomial(except for length 1 or 2)

can any one display the code for this program

I can't understand how to generate the sequence.pls help me

yall guys need help???????????????????

its wednesday my doods