Skip to content

Latest commit

 

History

History
449 lines (436 loc) · 9.47 KB

39.md

File metadata and controls

449 lines (436 loc) · 9.47 KB
Raw

Results of GPT-4 on HumanEval/39

Date: 18 July, 2023
Model: gpt-4
Temperature: 0.2
Passing runs: 10
Total runs: 10
Success rate: 100%

Prompt

Tokens: 123

def prime_fib(n: int):
    """
    prime_fib returns n-th number that is a Fibonacci number and it's also prime.
    >>> prime_fib(1)
    2
    >>> prime_fib(2)
    3
    >>> prime_fib(3)
    5
    >>> prime_fib(4)
    13
    >>> prime_fib(5)
    89
    """

The above is an incomplete Python code fragment. Return the complete and correct code with no additional text.

Correct solution

def prime_fib(n: int):
    """
    prime_fib returns n-th number that is a Fibonacci number and it's also prime.
    >>> prime_fib(1)
    2
    >>> prime_fib(2)
    3
    >>> prime_fib(3)
    5
    >>> prime_fib(4)
    13
    >>> prime_fib(5)
    89
    """import math

    def is_prime(p):
        if p < 2:
            return False
        for k in range(2, min(int(math.sqrt(p)) + 1, p - 1)):
            if p % k == 0:
                return False
        return True
    f = [0, 1]
    while True:
        f.append(f[-1] + f[-2])
        if is_prime(f[-1]):
            n -= 1
        if n == 0:
            return f[-1]

Unit tests

METADATA = {}


def check(candidate):
    assert candidate(1) == 2
    assert candidate(2) == 3
    assert candidate(3) == 5
    assert candidate(4) == 13
    assert candidate(5) == 89
    assert candidate(6) == 233
    assert candidate(7) == 1597
    assert candidate(8) == 28657
    assert candidate(9) == 514229
    assert candidate(10) == 433494437

Runs

✅ Run 1

Start time: 2023-07-18 18:42:43
Duration: 18.64s
Completion tokens: 222
Result: Pass

def prime_fib(n: int):
    """
    prime_fib returns n-th number that is a Fibonacci number and it's also prime.
    >>> prime_fib(1)
    2
    >>> prime_fib(2)
    3
    >>> prime_fib(3)
    5
    >>> prime_fib(4)
    13
    >>> prime_fib(5)
    89
    """
    def is_prime(num):
        if num < 2:
            return False
        for i in range(2, int(num**0.5) + 1):
            if num % i == 0:
                return False
        return True

    fibs = [0, 1]
    primes = []
    i = 2
    while len(primes) < n:
        fibs.append(fibs[i-1] + fibs[i-2])
        if is_prime(fibs[i]):
            primes.append(fibs[i])
        i += 1
    return primes[n-1]

✅ Run 2

Start time: 2023-07-18 18:42:23
Duration: 19.67s
Completion tokens: 232
Result: Pass

def prime_fib(n: int):
    """
    prime_fib returns n-th number that is a Fibonacci number and it's also prime.
    >>> prime_fib(1)
    2
    >>> prime_fib(2)
    3
    >>> prime_fib(3)
    5
    >>> prime_fib(4)
    13
    >>> prime_fib(5)
    89
    """
    def is_prime(num):
        if num < 2:
            return False
        for i in range(2, int(num**0.5) + 1):
            if num % i == 0:
                return False
        return True

    fib_seq = [0, 1]
    prime_fibs = []
    i = 2
    while len(prime_fibs) < n:
        fib_seq.append(fib_seq[i-1] + fib_seq[i-2])
        if is_prime(fib_seq[i]):
            prime_fibs.append(fib_seq[i])
        i += 1
    return prime_fibs[-1]

✅ Run 3

Start time: 2023-07-18 18:42:10
Duration: 12.73s
Completion tokens: 176
Result: Pass

def is_prime(n: int) -> bool:
    if n <= 1:
        return False
    if n == 2:
        return True
    if n % 2 == 0:
        return False
    i = 3
    while i * i <= n:
        if n % i == 0:
            return False
        i += 2
    return True

def prime_fib(n: int) -> int:
    fib = [0, 1]
    prime_fibs = []
    i = 2
    while len(prime_fibs) < n:
        fib.append(fib[i-1] + fib[i-2])
        if is_prime(fib[i]):
            prime_fibs.append(fib[i])
        i += 1
    return prime_fibs[-1]

✅ Run 4

Start time: 2023-07-18 18:41:50
Duration: 19.74s
Completion tokens: 226
Result: Pass

def prime_fib(n: int):
    """
    prime_fib returns n-th number that is a Fibonacci number and it's also prime.
    >>> prime_fib(1)
    2
    >>> prime_fib(2)
    3
    >>> prime_fib(3)
    5
    >>> prime_fib(4)
    13
    >>> prime_fib(5)
    89
    """
    def is_prime(num):
        if num < 2:
            return False
        for i in range(2, int(num**0.5) + 1):
            if num % i == 0:
                return False
        return True

    fib = [0, 1]
    prime_fibs = []
    i = 2
    while len(prime_fibs) < n:
        fib.append(fib[i-1] + fib[i-2])
        if is_prime(fib[i]):
            prime_fibs.append(fib[i])
        i += 1
    return prime_fibs[-1]

✅ Run 5

Start time: 2023-07-18 18:41:34
Duration: 15.85s
Completion tokens: 232
Result: Pass

def prime_fib(n: int):
    """
    prime_fib returns n-th number that is a Fibonacci number and it's also prime.
    >>> prime_fib(1)
    2
    >>> prime_fib(2)
    3
    >>> prime_fib(3)
    5
    >>> prime_fib(4)
    13
    >>> prime_fib(5)
    89
    """
    def is_prime(num):
        if num < 2:
            return False
        for i in range(2, int(num**0.5) + 1):
            if num % i == 0:
                return False
        return True

    fib_seq = [0, 1]
    prime_fibs = []
    i = 2
    while len(prime_fibs) < n:
        fib_seq.append(fib_seq[i-1] + fib_seq[i-2])
        if is_prime(fib_seq[i]):
            prime_fibs.append(fib_seq[i])
        i += 1
    return prime_fibs[-1]

✅ Run 6

Start time: 2023-07-18 18:41:12
Duration: 22.01s
Completion tokens: 232
Result: Pass

def prime_fib(n: int):
    """
    prime_fib returns n-th number that is a Fibonacci number and it's also prime.
    >>> prime_fib(1)
    2
    >>> prime_fib(2)
    3
    >>> prime_fib(3)
    5
    >>> prime_fib(4)
    13
    >>> prime_fib(5)
    89
    """
    def is_prime(num):
        if num < 2:
            return False
        for i in range(2, int(num**0.5) + 1):
            if num % i == 0:
                return False
        return True

    fib_seq = [0, 1]
    prime_fibs = []
    i = 2
    while len(prime_fibs) < n:
        fib_seq.append(fib_seq[i-1] + fib_seq[i-2])
        if is_prime(fib_seq[i]):
            prime_fibs.append(fib_seq[i])
        i += 1
    return prime_fibs[-1]

✅ Run 7

Start time: 2023-07-18 18:40:51
Duration: 21.37s
Completion tokens: 233
Result: Pass

def prime_fib(n: int):
    """
    prime_fib returns n-th number that is a Fibonacci number and it's also prime.
    >>> prime_fib(1)
    2
    >>> prime_fib(2)
    3
    >>> prime_fib(3)
    5
    >>> prime_fib(4)
    13
    >>> prime_fib(5)
    89
    """
    def is_prime(num):
        if num < 2:
            return False
        for i in range(2, int(num**0.5) + 1):
            if num % i == 0:
                return False
        return True

    fib_seq = [0, 1]
    prime_fibs = []
    i = 2
    while len(prime_fibs) < n:
        fib_seq.append(fib_seq[i-1] + fib_seq[i-2])
        if is_prime(fib_seq[i]):
            prime_fibs.append(fib_seq[i])
        i += 1
    return prime_fibs[n-1]

✅ Run 8

Start time: 2023-07-18 18:40:31
Duration: 20.01s
Completion tokens: 232
Result: Pass

def prime_fib(n: int):
    """
    prime_fib returns n-th number that is a Fibonacci number and it's also prime.
    >>> prime_fib(1)
    2
    >>> prime_fib(2)
    3
    >>> prime_fib(3)
    5
    >>> prime_fib(4)
    13
    >>> prime_fib(5)
    89
    """
    def is_prime(num):
        if num < 2:
            return False
        for i in range(2, int(num**0.5) + 1):
            if num % i == 0:
                return False
        return True

    fib_seq = [0, 1]
    prime_fibs = []
    i = 2
    while len(prime_fibs) < n:
        fib_seq.append(fib_seq[i-1] + fib_seq[i-2])
        if is_prime(fib_seq[i]):
            prime_fibs.append(fib_seq[i])
        i += 1
    return prime_fibs[-1]

✅ Run 9

Start time: 2023-07-18 18:40:11
Duration: 19.31s
Completion tokens: 232
Result: Pass

def prime_fib(n: int):
    """
    prime_fib returns n-th number that is a Fibonacci number and it's also prime.
    >>> prime_fib(1)
    2
    >>> prime_fib(2)
    3
    >>> prime_fib(3)
    5
    >>> prime_fib(4)
    13
    >>> prime_fib(5)
    89
    """
    def is_prime(num):
        if num < 2:
            return False
        for i in range(2, int(num**0.5) + 1):
            if num % i == 0:
                return False
        return True

    fib_seq = [0, 1]
    prime_fibs = []
    i = 2
    while len(prime_fibs) < n:
        fib_seq.append(fib_seq[i-1] + fib_seq[i-2])
        if is_prime(fib_seq[i]):
            prime_fibs.append(fib_seq[i])
        i += 1
    return prime_fibs[-1]

✅ Run 10

Start time: 2023-07-18 18:39:56
Duration: 15.77s
Completion tokens: 232
Result: Pass

def prime_fib(n: int):
    """
    prime_fib returns n-th number that is a Fibonacci number and it's also prime.
    >>> prime_fib(1)
    2
    >>> prime_fib(2)
    3
    >>> prime_fib(3)
    5
    >>> prime_fib(4)
    13
    >>> prime_fib(5)
    89
    """
    def is_prime(num):
        if num < 2:
            return False
        for i in range(2, int(num**0.5) + 1):
            if num % i == 0:
                return False
        return True

    fib_seq = [0, 1]
    prime_fibs = []
    i = 2
    while len(prime_fibs) < n:
        fib_seq.append(fib_seq[i-1] + fib_seq[i-2])
        if is_prime(fib_seq[i]):
            prime_fibs.append(fib_seq[i])
        i += 1
    return prime_fibs[-1]