Oy. If you need to do this, whatever it is, do 3. Oy.
No I will NOT do 3
How else will you do this?
I am one of the best problem-solvers when making GKC maps. Tell me what you’re doing, and I can (hopefully) help. Just tell us!
Read all the posts on this topic, then you’ll understand.
I have… oh God, I have. However, maybe there’s an alternate way to do it?
Solve the Riemann hypothesis to find the alternate way lol
No, there might be another way, depending on what he’s trying to do.
So what are you trying to do??? Please tell me!!! 
He’s generating large prime numbers for an RSA algorithm. You would know this if you read the posts…
I did!!! I read all of them! I want to know why he needs them. I don’t know what RSA is, but I can still help if I know what he needs it for.
It’s encryption using large prime numbers or something.
It’s a secret! I will not tell you what it’s about.
Why not??? Only a few people will see it!!!
I want to help you! I may not understand this math talk, being less than halfway through eighth grade math, but maybe there’s an alternate way!
I’ll give you an outline
- It’s not exactly a map
- It’s a theoretical idea
I can say one things
- You can only do 3 or make something up
- You could just put all the possible 2048 bit prime numbers and randomizer per say,
1=2048 bit prime number 1
2=2048 bit prime number 2
And on and on
Why do you think I said secret?