I am trying to apply the Chinese remainder theorem to solve the time required for all of the events to occur simultaneously. I am ignoring the GIF timing bug.

I am trying to apply the Chinese remainder theorem to solve the time required for all of the events to occur simultaneously. I am ignoring the GIF timing bug. 1. Normalize times to integers. 2. Assume congruence at x = t mod (t+1). 3. Solve congruence system. 4. Denormalize result. Python solution: http://ideone.com/Wh2SR6 http://ideone.com/Wh2SR6 Solution perspective: http://www.wolframalpha.com/input/?i=3541760026837707223455613087881588712157229686722179240978118057837619969343910617190906282246617252766842304240193875476480000000000+seconds http://www.wolframalpha.com/input/?i=35417600268377072234556...