Anonymous user
Talk:Frobenius numbers: Difference between revisions
m
→task clarification: added a new talk section concerning the limit.
(added a talk topic.) |
m (→task clarification: added a new talk section concerning the limit.) |
||
Line 1:
==
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 OEIS entry A037165 by Victoria A. Sapko). They are also known as ''Frobenius numbers''. -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 22:57, 1 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) < 10,000''' </big>
it was meant to mean:
<big> a(n) = prime(n)*prime(n+1) - prime(n) - prime(n+1), where '''n < 10,000''' </big>
This is based on the output for the '''Ring''' example's output. -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 23:33, 1 April 2021 (UTC)
| |||