'The efficient approach to generate a string of prime numbers with length 10005

I need to generate a string consists of prime numbers. The string will be like "235711..." and the length of the string needs to be 10005.

My thought on implementing this:

  1. Generate the prime number 1 by 1
  2. Concatenate each prime
  3. Check the length of the string, if it is less than 10005, then continue the process

May I ask what would be your comment on this?

Thank you very much in advance.

stringprimes


Sources

This article follows the attribution requirements of Stack Overflow and is licensed under CC BY-SA 3.0.

Source: Stack Overflow

Solution Source

Related Questions