On the Frobenius Problem for Some Generalized Fibonacci Subsequences -- I
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866912108504940544 |
|---|---|
| author | Panda, Santak Rai, Kartikeya Tripathi, Amitabha |
| author_facet | Panda, Santak Rai, Kartikeya Tripathi, Amitabha |
| contents | For a set $A$ of positive integers with $\gcd(A)=1$, let $\langle A \rangle$ denote the set of all finite linear combinations of elements of $A$ over the non-negative integers. The it is well known that only finitely many positive integers do not belong to $\langle A \rangle$. The Frobenius number and the genus associated with the set $A$ is the largest number and the cardinality of the set of integers non-representable by $A$. By a generalized Fibonacci sequence $\{V_n\}_{n \ge 1}$ we mean any sequence of positive integers satisfying the recurrence $V_n=V_{n-1}+V_{n-2}$ for $n \ge 3$. We study the problem of determining the Frobenius number and genus for sets $A=\{V_n,V_{n+d},V_{n+2d},\ldots\}$ for arbitrary $n$, where $d$ odd or $d=2$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_04465 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | On the Frobenius Problem for Some Generalized Fibonacci Subsequences -- I Panda, Santak Rai, Kartikeya Tripathi, Amitabha Number Theory 11D07, 20M14, 20M30 For a set $A$ of positive integers with $\gcd(A)=1$, let $\langle A \rangle$ denote the set of all finite linear combinations of elements of $A$ over the non-negative integers. The it is well known that only finitely many positive integers do not belong to $\langle A \rangle$. The Frobenius number and the genus associated with the set $A$ is the largest number and the cardinality of the set of integers non-representable by $A$. By a generalized Fibonacci sequence $\{V_n\}_{n \ge 1}$ we mean any sequence of positive integers satisfying the recurrence $V_n=V_{n-1}+V_{n-2}$ for $n \ge 3$. We study the problem of determining the Frobenius number and genus for sets $A=\{V_n,V_{n+d},V_{n+2d},\ldots\}$ for arbitrary $n$, where $d$ odd or $d=2$. |
| title | On the Frobenius Problem for Some Generalized Fibonacci Subsequences -- I |
| topic | Number Theory 11D07, 20M14, 20M30 |
| url | https://arxiv.org/abs/2411.04465 |