### Bluebook

## Ten Primes on a Line

A natural number `N` (greater than one), is a prime number if it has no
natural number divisors other than 1 and `N`. Given an integer `M`,
write a program that finds the first `M` primes, printing them ten to a line.
Each number should be separated by a space.

### Sample Input

5

### Sample Output

2 3 5 7 11

All Submissions

Best Solutions

**Point Value:** 5

**Time Limit:** 2.00s

**Memory Limit:** 16M

**Added:** Oct 27, 2008

**Languages Allowed:**

C++03, PAS, C, HASK, ASM, RUBY, PYTH2, JAVA, PHP, SCM, CAML, PERL, C#, C++11, PYTH3

## Comments (Search)

gpfaulton Jan 21, 2017 - 4:36:38 pm UTC Max?jargonon Jan 22, 2017 - 1:56:52 am UTC Re: Max?Aaishaon Aug 30, 2015 - 2:56:54 am UTCwgma00on Aug 30, 2015 - 5:46:03 am UTC Re: ...Aaishaon Aug 30, 2015 - 7:28:57 am UTC Re: ...wgma00on Aug 30, 2015 - 3:44:31 pm UTC Re: ...Aaishaon Sep 01, 2015 - 6:34:38 am UTC Re: ...wgma00on Sep 01, 2015 - 5:42:08 pm UTC Re: ...https://en.wikipedia.org/wiki/Primality_test

Aaishaon Sep 02, 2015 - 5:25:32 am UTC Re: ...XZNZon Nov 14, 2011 - 11:08:10 pm UTC what am i doing wrong 10/30?jargonon Nov 14, 2011 - 11:09:39 pm UTC Re: what am i doing wrong 10/30?