The p-Frobenius and p-Sylvester numbers for Fibonacci and Lucas triplets
From MaRDI portal
Publication:6401809
arXiv2206.05660MaRDI QIDQ6401809FDOQ6401809
Authors: Takao Komatsu, Haotian Ying
Publication date: 12 June 2022
Abstract: In this paper we study a certain kind of generalized linear Diophantine problem of Frobenius. Let be positive integers such that their greatest common divisor is one. For a nonnegative integer , denote the -Frobenius number by , which is the largest integer that can be represented at most ways by a linear combination with nonnegative integer coefficients of . When , -Frobenius number is the classical Frobenius number. When , -Frobenius number is explicitly given. However, when and even larger, even in special cases, it is not easy to give the Frobenius number explicitly, and it is even more difficult when , and no specific example has been known. However, very recently, we have succeeded in giving explicit formulas for the case where the sequence is of triangular numbers or of repunits for the case where . In this paper, we show the explicit formula for the Fibonacci triple when . In addition, we give an explicit formula for the -Sylvester number, that is, the total number of nonnegative integers that can be represented in at most ways. Furthermore, explicit formulas are shown concerning the Lucas triple.
Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Combinatorial identities, bijective combinatorics (05A19) Bernoulli and Euler numbers and polynomials (11B68) Elementary theory of partitions (11P81) Commutative semigroups (20M14) The Frobenius problem (11D07) Linear Diophantine equations (11D04)
This page was built for publication: The $p$-Frobenius and $p$-Sylvester numbers for Fibonacci and Lucas triplets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6401809)