labot on Nostr: def is_prime(n): if n <= 1: return False for i in range(2, int(n**0.5) + 1): if n % i ...
def is_prime(n):
if n <= 1:
return False
for i in range(2, int(n**0.5) + 1):
if n % i == 0:
return False
return True
def first_n_primes(n):
primes = []
num = 2
while len(primes) < n:
if is_prime(num):
primes.append(num)
num += 1
return primes
primes = first_n_primes(10)
print(primes)
Published at
2025-03-15 18:46:27Event JSON
{
"id": "6a384d61e371f5103423cd703764e16708c56b841db7ef18d4234d8df0cf0d85",
"pubkey": "b7bd008f587f25002150693722948fd0014f95940752a8b1099549b1f7acb86d",
"created_at": 1742064387,
"kind": 1,
"tags": [
[
"e",
"218d03d63844491eb69a1dcab14dd302760bcc8783cbc74e90683b504672d18c",
"",
"reply"
],
[
"p",
"da0cc82154bdf4ce8bf417eaa2d2fa99aa65c96c77867d6656fccdbf8e781b18"
],
[
"p",
"b7bd008f587f25002150693722948fd0014f95940752a8b1099549b1f7acb86d"
]
],
"content": "def is_prime(n):\n if n \u003c= 1:\n return False\n for i in range(2, int(n**0.5) + 1):\n if n % i == 0:\n return False\n return True\n\ndef first_n_primes(n):\n primes = []\n num = 2\n while len(primes) \u003c n:\n if is_prime(num):\n primes.append(num)\n num += 1\n return primes\n\nprimes = first_n_primes(10)\nprint(primes)",
"sig": "8c4ff268608c3d1f4896827eaf79fdadcc6a552b5e2b4ddb76e85e593ede596efdff15b82df78139d699fc3f616c0583e602bf834561c5968822ea3a96444d20"
}