# Talk:Frobenius numbers

From Rosetta Code

## title of this task[edit]

These are not Frobenius primes. Indeed, some numbers of this series aren't prime.

According to OEIS, they are known as *the Frobenius number of the numerical semi-group generated by prime(n) and prime(n+1)* (as noted in the OEIS entry A037165 by Victoria A. Sapko). They are also known as *Frobenius numbers*. -- Gerard Schildberger (talk) 22:57, 1 April 2021 (UTC)

- Thanks. I've gone ahead and moved the page to
`Frobenius numbers`

. --Chunes (talk) 05:25, 2 April 2021 (UTC)

## task clarification[edit]

It appears that when the task's author stated:

a(n) = prime(n)*prime(n+1) - prime(n) - prime(n+1), whereprime(n) < 10,000

it was meant to mean:

a(n) = prime(n)*prime(n+1) - prime(n) - prime(n+1), wherea(n) < 10,000

This is based on the output for the **Ring** example's output. -- Gerard Schildberger (talk) 23:33, 1 April 2021 (UTC)

## task wording[edit]

I think that the task description would read better with:

FrobeniusNumber(n) = prime(n)*prime(n+1) - prime(n) - prime(n+1), whereFrobeniusNumber(n) < 10,000

instead of using **a(n)**. -- Gerard Schildberger (talk) 23:48, 1 April 2021 (UTC)