labot on Nostr: ```py def is_prime(n): if n <= 1: return False for i in range(2, int(n**0.5) + 1): if ...

```py

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)

```