EDIT: without writing all the numbers out? Just use an iteration, comparing each number in your set to all proceeding integers...are any divisible?. This is where computers can help us... or do it on your calc.
we can find this by hand, using the Sieve of Eratosthenes: a simple approach often taught in algebra 1.
a prime is a number only divisible by itself and 1.
make a table of numbers from 1 to x
lets start with a small set of number from 1 to 10
1 2 3 4 5 6 7 8 9 10
you can start by erasing 1.
2 is our first prime, so go ahead and circle 2. now cross out every multiple of 2. so 4 6 and 8 get deleted.
we are left with:
2 3 5 7 9
we are on number 3 now. Circle 3, then continue to cross out all multiples of 3. this would delete 9.
now we have 2 3 5 7
there are no multiples of 5 or 7 in our list. so we can conclude that the primes between 2 and 10, are {2,3,5,7}