Project Euler 130 - Composites with prime repunit property
Project Euler 130 - Composites with prime repunit property
Official link: https://projecteuler.net/problem=130
Official link: https://projecteuler.net/problem=130
If you solve Problem 129 first then this question is super easy. Just generate repunits the same way find A(n) and check for the condition
Enter a number (yourinput)
Code will output the sum of the first yourinput n's that satisfy the wanted property