We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. All Contests
  2. ProjectEuler+
  3. Project Euler #188: The hyperexponentiation of a number
  4. Discussions

Project Euler #188: The hyperexponentiation of a number

Sort by

recency

|

8 Discussions

|

  • Prudhvik19961
     + 0 comments

    I could only pass 7, 8 and 20th test cases. While I could pass 0th test case while test run, I could not pass it while main run.

    Can someone help me out..

  • petmalu
     + 2 comments

    I used Sieve, Extended Euclid, Pollard Rho, Miller-Rabin, Chinese Remainder Theorem, Euler's Theorem, and Super Logarithm (sort of). :D

  • arunkumarv222
     + 0 comments

    i got runtimeerror while submitting the code.why i can't understand please anyone help me......

  • jpitz
     + 0 comments

    https://github.com/retiman/project-euler/blob/bef367b700d350272707b728a99a69f83bb2eb99/strategies/problem-00188.txt

    Is this going into the right direction? What can you do if gcd(a, m) > 1

    I tried using phi(m) in all cases, but I get incorrect results (as expected), but not reducing the size of the exponent, even if I do so, only when gcd > 1, still gets me timeouts.

    Note: I already stop the recusion if m = 1;

  • jason_v12
     + 1 comment

    Mine won't work because of timeout! Is there any way around this?