Talk:Frobenius numbers: Difference between revisions
Content added Content deleted
m (→title of this task: added an article.) |
(→title of this task: Frobenius numbers are more general.) |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Line 3: | Line 3: | ||
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''. -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 22:57, 1 April 2021 (UTC) |
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''. -- [[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 == |
== task clarification == |
||
It appears that when the task's author stated: |
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) |
<big> a(n) = prime(n)*prime(n+1) - prime(n) - prime(n+1), where '''prime(n) < 10,000''' </big> |
||
it was meant to mean: |
it was meant to mean: |
||
<big> a(n) = prime(n)*prime(n+1) - prime(n) - prime(n+1), where '''a(n) |
<big> a(n) = prime(n)*prime(n+1) - prime(n) - prime(n+1), where '''a(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) |
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) |
||
== 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) < 10,000''' </big> |
|||
instead of using '''a(n)'''. -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 23:48, 1 April 2021 (UTC) |
|||
Latest revision as of 05:35, 2 April 2021
title of this task
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
It appears that when the task's author stated:
a(n) = prime(n)*prime(n+1) - prime(n) - prime(n+1), where prime(n) < 10,000
it was meant to mean:
a(n) = prime(n)*prime(n+1) - prime(n) - prime(n+1), where a(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
I think that the task description would read better with:
FrobeniusNumber(n) = prime(n)*prime(n+1) - prime(n) - prime(n+1), where FrobeniusNumber(n) < 10,000
instead of using a(n). -- Gerard Schildberger (talk) 23:48, 1 April 2021 (UTC)