Recent content by IndigoLaser

  1. IndigoLaser

    Challenge: Submit Extremely Difficult Math Problems

    Consider this recursive function: (216 = 65536) I've concluded that xi will be equal to 0 again for any positive odd integers a and b where i ≤ 216 If a and b can let this recursive function generate 216 non-repeating x values (x216 is equal to 0 again), (a,b) is considered a solution. How do I...
Back
Top