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.
Efficiently computing A is the aim of problem 129. You should probably try that one before, and then ask yourself if, considering the size of the inputs here, computing A actually is a good idea anyway...
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Join us
Create a HackerRank account
Be part of a 26 million-strong community of developers
Please signup or login in order to view this challenge
Project Euler #130: Composites with prime repunit property
You are viewing a single comment's thread. Return to all comments →
is anybody know how to calculate A(i)? Thnks.!
Efficiently computing A is the aim of problem 129. You should probably try that one before, and then ask yourself if, considering the size of the inputs here, computing A actually is a good idea anyway...