Prime Numbers Thread Community Number Game
- Partager cette discussion
- Copier le lien
- Partager sur X (Twitter)
Résumé
In E dating ♡ | Ask2dm • Social • Vc • Adult • Gaming this announcement shares a playful prime numbers thread where members list primes, call out mistakes, and trade tips. The conversation includes practical algorithm notes, coding ideas for storing primes, and light banter to engage the community and encourage participation.
Write as many primes as you can here cause why wouldn't you?
2
3
5
7
11
13
15
17
19
23
29
31
37
Not prime. Stfu
Wait
I'm dumb
Faaahhhh
41
43
47
53
59
61
67
71
73
79
83
89
91
97
101
103
https://tenor.com/view/enrico-pucci-pucchi-new-moon-jojo-stone-ocean-part6-gif-26729614
Did someone say prime numbers
Don't
Yes🗿
107
Nooooiiii
Yeah, 109 is a prime.
Ts is divisible by 11111111.
Actually...nope. I'm wrong about this. I mean, that is not a prime but not divisible by 11111111.
Man, I say some really dumb shit sometimes...
Most of the time actually.
Wait, that's from an actual conversation?
Seems to be a prime. There's an algorithm to make the search easy btw. If you want to know if a number is a prime, try dividing by integers lowers than its square root.
I forgot the name, though.
I used it to write a program in C. It was way faster than if you checked with every number.
Yep. It reduces computation and is very accurate.
Yeah, but adding that in the code wouldn't optimize it much.
*divide by primes before the Sqrt of the said number
Not every integer :))
I just noticed...Thanks
I mean, yeah. That's the mathematical statement. But, that won't make the programme faster unless you have all of those primes saved in an array or something.
well, you can always run in a programme that defines primes first. We already know hot to identify primes, so thats not a biggie.
There's a problem. There are an infinite number of primes and no formula to identify them at once. So, yeah.
Im not sure what programme you use but in some you can define the characteristics of the numbers, say - primes are numbers that are coprime with every integer less than their sqrt + primes are of the form 6k plus minus 1
Yeah, I had that idea a while ago too. Like make the programme save the primes it identified in a binary file and use it to identify larger primes. Maybe I should do it. It'd be dope.
I was talking about writing a programme from scratch. I don't think C or Python understands natural language. To find whether a number is divisible, you'd need to loop through numbers.
What does that mean?
figures
Now, is 113 a prime?
It is.
Lmaooo
Natural language, the ones we use. Human language.
117 is not a prime. It's divisible by 3, 9 and 13.
You know what? I'm gonna paste the first 200 primes from my programme along with the code...later. I'm lazy.