Given a number n, determine what the nth prime is.
By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13.
If your language provides methods in the standard library to deal with prime numbers, pretend they don't exist and implement them yourself.
| Register | Usage | Type | Description |
|---|---|---|---|
$a0 |
input | integer | prime index |
$v0 |
output | integer | nth prime value |
$t0-9 |
temporary | any | used for temporary storage |
Edit via GitHub
Sign up to Exercism to learn and master MIPS Assembly with 47 exercises, and real human mentoring, all for free.
