View source for Talk:Frobenius numbers

== title of this task ==
These are not Frobenius primes. &nbsp; Indeed, some numbers of this series aren't prime.

According to OEIS, &nbsp; they are known as &nbsp; ''the Frobenius number of the numerical semi-group generated by prime(n) and prime(n+1)'' &nbsp; &nbsp; &nbsp; (as noted in the OEIS entry A037165 by Victoria A. Sapko). &nbsp; &nbsp; They are also known as &nbsp; ''Frobenius numbers''. &nbsp; &nbsp; -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 22:57, 1 April 2021 (UTC)
: Thanks. I've gone ahead and moved the page to <code>Frobenius numbers</code>. --[[User:Chunes|Chunes]] ([[User talk:Chunes|talk]]) 05:25, 2 April 2021 (UTC)
:: However, it appears that Frobenius numbers are quite a bit more general than this. This sequence is the Frobenius numbers for a very specific input. --[[User:Chunes|Chunes]] ([[User talk:Chunes|talk]]) 05:35, 2 April 2021 (UTC)

== task clarification ==

It appears that when the task's author stated:
      <big> a(n) = prime(n)*prime(n+1) - prime(n) - prime(n+1), where '''prime(n) &lt; 10,000''' </big>
it was meant to mean:
      <big> a(n) = prime(n)*prime(n+1) - prime(n) - prime(n+1), where '''a(n)     &lt; 10,000''' </big>


This is based on the output for the &nbsp; '''Ring''' &nbsp; example's output. &nbsp; &nbsp; -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 23:33, 1 April 2021 (UTC)


== task wording ==

I think that the task description would read better with:

     <big> FrobeniusNumber(n)  =  prime(n)*prime(n+1) - prime(n) - prime(n+1), where '''FrobeniusNumber(n) &lt; 10,000''' </big>

instead of using &nbsp; '''a(n)'''. &nbsp; &nbsp; -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 23:48, 1 April 2021 (UTC)