 # chynh's solution

## to Nth Prime in the PHP Track

Published at Sep 22 2019 · 0 comments
Instructions
Test suite
Solution

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.

## Running the tests

1. Go to the root of your PHP exercise directory, which is `<EXERCISM_WORKSPACE>/php`. To find the Exercism workspace run

`````` % exercism debug | grep Workspace
``````
2. Get PHPUnit if you don't have it already.

`````` % wget --no-check-certificate https://phar.phpunit.de/phpunit.phar
% chmod +x phpunit.phar
``````
3. Execute the tests:

`````` % ./phpunit.phar nth-prime/nth-prime_test.php
``````

## Source

A variation on Problem 7 at Project Euler http://projecteuler.net/problem=7

## Submitting Incomplete Solutions

It's possible to submit an incomplete solution so you can see how others have completed the exercise.

### nth-prime_test.php

``````<?php

class NthPrimeTest extends PHPUnit\Framework\TestCase
{
public static function setUpBeforeClass() : void
{
require_once 'nth-prime.php';
}

public function testFirstPrime() : void
{
\$this->assertEquals(2, prime(1));
}
public function testSecondPrime() : void
{
\$this->assertEquals(3, prime(2));
}
public function testSixthPrime() : void
{
\$this->assertEquals(13, prime(6));
}
public function testBigPrime() : void
{
\$this->assertEquals(104743, prime(10001));
}
public function testZeroPrime() : void
{
\$this->assertEquals(false, prime(0));
}
}``````
``````<?php
function prime(int \$nth)
{
if (\$nth < 1) return FALSE;
\$count = 1;
\$candidate = 3;
while (\$count < \$nth) {
\$found = FALSE;
for (\$j = 2; \$j < \$candidate; \$j++) {
if (\$candidate % \$j === 0 || \$candidate % 2 === 0) {
break;
}
}
\$found = \$candidate === \$j;
if (\$found) {
\$count++;
}
\$candidate++;
}
return \$candidate - 1;
}``````