As I pointed out irrational numbers can easily have a well-defined structure. Here's the start of the Champernowne constant: 0.123456789101112131415161718192

As I pointed out irrational numbers can easily have a well-defined structure. Here's the start of the Champernowne constant: 0.1234567891011121314151617181920212223... It's not only irrational, but it's transcendental and normal. Yet it has so much structure that you can easily figure out what any digit 'n' will be. > The hobby of trying to find "the pattern" is I have no idea what you are talking about with "the pattern". > if there were an actual pattern, primes would not be useful in cryptography Why do you think there are no patterns and that all of the following people are wrong? * "Patterns in prime numbers" - https://mathsreach.org/Patterns_in_prime_numbers https://mathsreach.org/Patterns_in_prime_numbers * "Patterns in the Primes" - https://www.maa.org/meetings/calendar-events/patterns-in-the-primes https://www.maa.org/meetings/calendar-events/patterns-in-the... * "Math Mornings at Yale: The Patterns in the Primes, with Andrew Granville" - https://www.youtube.com/watch?v=pO7Egc5Dtqs https://www.youtube.com/watch?v=pO7Egc5Dtqs * "New Pattern Found in Prime Numbers" - https://phys.org/news/2009-05-pattern-prime.html https://phys.org/news/2009-05-pattern-prime.html * '"Patterns in the Primes" by Stephanie Hanson - Week 5 - MathSoc Public Lecture' - https://www.youtube.com/watch?v=VkbPhjU-S9Q https://www.youtube.com/watch?v=VkbPhjU-S9Q Note that none of these refer to a definite "the pattern." Primes are useful in the RSA cryptosystem because modulo exponentiation is cheap while in general factoring the product of two large prime numbers is far less tractable - as far as we know. There are so many patterns in primes that cryptosystems have been broken by choosing the initial primes poorly. See https://en.wikipedia.org/wiki/RSA_(cryptosystem)#Faulty_key_generation https://en.wikipedia.org/wiki/RSA_(cryptosystem)#Faulty_key_... .