The transcriptional risk scores for kidney renal clear cell carcinoma using XGBoost and multiple omics data

1.   Introduction

The linear Diophantine problem of Frobenius is to find the largest integer which is not expressed by a nonnegative linear combination of given positive relatively prime integers $a_1, a_2, \dots, a_l$. Such a largest integer is called the Frobenius number ^[3], denoted by $g(A) = g(a_1, a_2, \dots, a_l)$, where $A = \{a_1, a_2, \dots, a_l\}$. In the literature on the Frobenius problem, the Sylvester number or genus $n(A) = n(a_1, a_2, \dots, a_l)$, which is the total number of integers that cannot be represented as a nonnegative linear combination of $a_1, a_2, \dots, a_l$ ^[4].

There are many aspects to studying the Frobenius problem. For example, there are algorithmic aspects to find the values or the bounds, complexity of computations, denumerants, numerical semigroup, applications to algebraic geometry and so on (see e.g., ^[5,6]). Nevertheless, one of the motivations for our $p$-generalizations originates in the number of representations $d (n; a_1, a_2, \dots, a_l)$ to $a_1 x_1+a_2 x_2+\dots+a_l x_l = n$ for a given positive integer $n$. This number is equal to the coefficient of $x^n$ in $1/(1-x^{a_1})(1-x^{a_2})\cdots(1-x^{a_l})$ for positive integers $a_1, a_2, \dots, a_l$ with $\gcd (a_1, a_2, \dots, a_l) = 1$ ^[4]. Sylvester ^[7] and Cayley ^[8] showed that $d(n; a_1, a_2, \dots, a_l)$ can be expressed as the sum of a polynomial in $n$ of degree $k-1$ and a periodic function of period $a_1 a_2\cdots a_l$. In ^[9], the explicit formula for the polynomial part is derived by using Bernoulli numbers. For two variables, a formula for $d(n; a_1, a_2)$ is obtained in ^[10]. For three variables in the pairwise coprime case $d(n; a_1, a_2, a_3)$. For three variables, in ^[11], the periodic function part is expressed in terms of trigonometric functions, and its results have been improved in ^[12] by using floor functions so that three variables case can be easily worked with-in the formula.

In this paper, we are interested in one of the most general and most natural types of Frobenius numbers, which focuses on the number of representations. For a nonnegative integer $p$, the largest integer such that the number of expressions that can be represented by $a_1, a_2, \dots, a_l$ is at most $p$ is denoted by $g_p(A) = g_p(a_1, a_2, \dots, a_l)$ and may be called the $p$-Frobenius number. That is, all integers larger than $g_p(A)$ have at least the number of representations of $p+1$ or more. This generalized Frobenius number $g_p(A)$ is called the $p$-Frobenius number ^[1,2], which is also called the $k$-Frobenius number ^[13] or the $s$-Frobenius number ^[14]. When $p = 0$, $g(A) = g_0(A)$ is the original Frobenius number. One can consider the largest integer $g_p^\ast(a_1, a_2, \dots, a_l)$ that has exactly $p$ distinct representations (see e.g., ^[13,14]). However, in this case, the ordering $g_0^\ast\le g_1^\ast\le \cdots$ may not hold. For example, $g_{17}^\ast(2, 5, 7) = 43 > g_{18}^\ast(2, 5, 7) = 42$. In addition, for some $j$, $g_j^\ast$ may not exist. For example, $g_{22}^\ast(2, 5, 7)$ does not exist because there is no positive integer whose number of representations is exactly $22$. Therefore, in this paper we do not study $g_p^\ast(A)$ but $g_p(A)$.

Similarly to the $p$-Frobenius number, the $p$-Sylvester number or the $p$-genus $n_p(A) = n_p(a_1, a_2, \dots, a_l)$ is defined by the cardinality of the set of integers which can be represented by $a_1, a_2, \dots, a_l$ at most $p$ ways. When $p = 0$, $n(A) = n_0(A)$ is the original Sylvester number.

In this paper, we are interested in one of the most crucial topics, that is, to find explicit formulas of indicators, in particular, of $p$-Frobenius numbers and $p$-Sylvester numbers. In the classical case, that is, for $p = 0$, explicit formulas of $g(a_1, a_2)$ and $n(a_1, a_2)$ are shown when $l = 2$ ^[3,4]. However, for $l\ge 3$, $g(A)$ cannot be given by any set of closed formulas which can be reduced to a finite set of certain polynomials ^[15]. For $l = 3$, there are several useful algorithms to obtain the Frobenius number (see e.g., ^[16,17,18]). For the concretely given three positive integers, if the conditions are met, the Frobenius number can be completely determined by the method of case-dividing by A. Tripathi ^[19]. Although it is possible to find the Frobenius number by using the results in ^[19], it is another question whether the Frobenius number can be given by a closed explicit expression for some special triplets, and special considerations are required. Only for some special cases, explicit closed formulas have been found, including arithmetic, geometric, Mersenne, repunits and triangular (see ^[20,21,22] and references therein).

For $p > 0$, if $l = 2$, explicit formulas of $g_p(a_1, a_2)$ and $n_p(a_1, a_2)$ are still given without any difficulty (see e.g., ^[23]). However, if $l\ge 3$, no explicit formula had been given even in a special case. However, quite recently, we have succeeded in giving explicit formulas for the case where the sequence is of triangular numbers ^[1] or of repunits ^[2] for the case where $l = 3$.

In this paper, we give an explicit formula for the $p$-Frobenius number for the Fibonacci number triple $(F_i, F_{i+2}, F_{i+k})$ ($i, k\ge 3$). Here, the $n$-th Fibonacci number $F_n$ is defined by $F_n = F_{n-1}+F_{n-2}$ ($n\ge 2$) with $F_1 = 1$ and $F_0 = 0$. Our main result (Theorem 6.1 below) is a kind of generalizations of [24,Theorem 1] when $p = 0$. However, when $p > 0$, the exact situation is not completely similar to the case where $p = 0$, and the case by case discussion is necessary. As analogues, we also show explicit formulas of $g_p(L_i, L_{i+2}, L_{i+k})$ for Lucas numbers $L_n$ with $i, k\ge 3$. Here, Lucas numbers $L_n$ satisfy the recurrence relation $L_n = L_{n-1}+L_{n-2}$ ($n\ge 2$) with $L_0 = 2$ and $L_1 = 1$. By using our constructed framework, we can also find explicit formulas of the $p$-Sylvester numbers $n_p(F_i, F_{i+2}, F_{i+k})$ and $n_p(L_i, L_{i+2}, L_{i+k})$. Our result (Theorem 13) can extend the result in [24,Corollary 2]. The main idea is to find the explicit structure of the elements of an Apéry set ^[25]. In addition, we use a complete residue system, studied initially by Selmer ^[26]. By using Apéry sets, we construct the first least set of the complete residue system, then the second least set of the complete residue system, and the third, and so on. As a basic framework, we use a similar structure in ^[2]. We can safely say that one of our theorems (Theorem 6.1 below) is a kind of generalization of [24,Theorem 1]. Nevertheless, for each nonnegative integer $p$, the exact situation is not completely similar, but the case by case discussion is necessary.

2.   Preliminaries

Without loss of generality, we assume that $a_1 = \min\{a_1, a_2, \dots, a_l\}$. For each $0\le i\le a_1-1$, we introduce the positive integer $m_i^{(p)}$ congruent to $i$ modulo $a_1$ such that the number of representations of $m_i^{(p)}$ is bigger than or equal to $p+1$, and that of $m_i-a_1$ is less than or equal to $p$. Note that $m_0^{(0)}$ is defined to be $0$. The set

is called the $p$-Apéry set of $A = \{a_1, a_2, \dots, a_l\}$ for a nonnegative integer $p$, which is congruent to the set

When $p = 0$, the $0$-Apéry set is the original Apéry set ^[25].

It is hard to find any explicit formula of $g_p(a_1, a_2, \dots, a_l)$ when $l\ge 3$. Nevertheless, the following convenient formulas are known (see ^[28]). After finding the structure of $m_j^{(p)}$, we can obtain $p$-Frobenius or $p$-Sylvester numbers for triple $(F_i, F_{i+2}, F_{i+k})$.

Lemma 1. Let $k$, $p$ and $\mu$ be integers with $k\ge 2$, $p\ge 0$ and $\mu\ge 1$. Assume that $\gcd(a_1, a_2, \dots, a_l) = 1$. We have

Remark. When $p = 0$, (2.1) is the formula by Brauer and Shockley ^[27]:

where $m_j = m_j^{(0)}$ ($1\le j\le a_1-1$) with $m_0 = 0$. When $p = 0$, (2.2) is the formula by Selmer ^[26]:

Note that $m_0 = m_0^{(0)} = 0$. A more general form by using Bernoulli numbers is given in ^[28], as well as the concept of weighted sums ^[29,30].

It is necessary to find the exact situation of $0$-Apéry set ${\rm Ap} (F_i, 0)$, the least complete residue system, which was initially studied in ^[26]. Concerning Fibonacci numbers, we use the framework in ^[24].

Throughout this paper, for a fixed integer $i$, we write

for short. Then, we shall construct the set of the least complete residue system ${\rm Ap} (F_i; 0)$. That is, $m_j\not\equiv m_h\pmod{F_i}$ ($0\le j < h\le F_i-1$), and if for a positive integer $M$, $M\equiv j$ and $M\ne m_j$ ($0\le j\le F_i-1$), then $M > m_j$. Then, for the case $p = 1$ we shall construct the second set of the least complete residue system ${\rm Ap} (F_i; 1)$. That is, $m_j^{(1)}\not\equiv m_h^{(1)}\pmod{F_i}$ ($0\le j < h\le F_i-1$), $m_j^{(1)}\equiv m_j\pmod{F_i}$ ($0\le j\le F_i-1$), and there does not exist an integer $M$ such that $m_j^{(1)} > M > m_j$ and $M\equiv j\pmod{F_i}$. Similarly, for $p = 2$, we shall construct the third set of the least complete residue system ${\rm Ap} (F_i; 2)$. That is, $m_j^{(2)}\not\equiv m_h^{(2)}\pmod{F_i}$ ($0\le j < h\le F_i-1$), $m_j^{(2)}\equiv m_j^{(1)}\pmod{F_i}$ ($0\le j\le F_i-1$), and there does not exist an integer $M$ such that $m_j^{(2)} > M > m_j^{(1)}$ and $M\equiv j\pmod{F_i}$.

By using a similar frame as in ^[24], we first show an analogous result about Lucas triple $(L_i, L_{i+2}, L_{i+k})$ when $p = 0$. As a preparation we shall show the result when $p = 0$, with a sketch of the proof. The results about Fibonacci numbers can be applied to get those about Lucas numbers. When $p = 0$, by setting integers $r$ and $\ell$ as $L_i-1 = r F_k+\ell$ with $r\ge 0$ and $0\le\ell\le F_k-1$ and by using the identity $L_n = L_m F_{n-m+1}+L_{m-1}F_{n-m}$, we can get an analogous identity of the Fibonacci one in [24,Theorem 1].

Theorem 1. For integers $i, k\ge 3$ and $r = \left\lfloor{(L_i-1)/F_k}\right\rfloor$, we have

Proof. Consider the linear representation

Then, by $\gcd(L_i, L_{i+2}) = 1$, we can prove that the above table represents the least complete residue system $\{0, 1, \dots, L_i-1\}\pmod{L_i}$.

That is, we can prove that none of two elements among this set is not congruent modulo $F_i$, and if there exists an element congruent to any of the elements among this set, then such an element is bigger and not in this set.

When $r = 0$, the largest element among all the $t_{x, y}$'s in this table is $t_{\ell, 0}$. When $r\ge 1$, the largest element is either $t_{F_k-1, r-1}$ or $t_{\ell, r}$. Since $t_{F_k-1, r-1} < t_{\ell, r}$ is equivalent to $F_{k-2}L_i < (L_i-r F_k)L_{i+2}$, the result is followed by the identity (2.3). The first case is given by $t_{\ell, r}-L_i$, and the second is given by $t_{F_k-1, r-1}-L_i$.

3.   Main results when $p=1$

Now, let us begin to consider the case $p\ge 1$. We shall obtain the Frobenius number using Lemma 1 (2.1). For this it is necessary to know the structure of the elements of the $p$-Apéry set, and the structure of the elements of the $p$-Apéry set depends on the structure of the elements of the ($p-1$)-Apéry set. Therefore, in the case of $p = 1$, the structure of the elements of the $1$-Apéry set is analyzed from the structure of the elements of the $0$-Apéry set, which is the original Apéry set, thereby obtaining the $1$-Frobenius number. When $p = 1$, we have the following.

Theorem 2. For $i\ge 3$, we have

When $r = \left\lfloor{(F_i-1)/F_k}\right\rfloor\ge 1$, that is, $k\le i-1$, we have

Remark. When $r\ge1$ and $k = i-1, i-2, i-3, i-4, i-5$, we have more explicit formulas.

Proof. Put the linear representation

For given $F_i$ and $F_k$, integers $r$ and $\ell$ are determined uniquely as $F_i-1 = r F_k+\ell$ with $0\le\ell\le F_k-1$.

The second set ${\rm Ap} (F_i; 1)$ can be yielded from the first set ${\rm Ap}(F_i; 0)$ as follows. Assume that $r\ge 1$. Only the first line $\{t_{0, 0}, t_{1, 0}, \dots, t_{F_k-1, 0}\}$ moves to fill the last gap in the ($r+1$)-st line, and the rest continue to the next ($r+2$)-nd line. Everything else from the second line shifts up by $1$ and moves to the next right block (When $r = 1$, the new right block consists of only one line $t_{F_k, 0}, \cdots, t_{F_k+\ell, 0}$, but this does not affect the final result).

The first group is summarized as

for $0\le x\le F_k-1$ and $1\le y\le r-1$ or $0\le x\le\ell$ and $y = r$. This congruence is valid because

The second group is valid because for $0\le x\le F_k-\ell-2$,

The third group is valid because for $0\le x\le \ell$,

Assume that $r = 0$. The first set ${\rm Ap}(F_i; 0)$ consists of only the first line. If $2\ell+1\ge F_k$, then the second set ${\rm Ap}(F_i; 1)$ can be yielded by moving to fill the last gap in the line, the rest continuing to the next line.

They are valid because for $0\le j\le F_k-\ell-2$,

and for $0\le j\le 2\ell+1-F_k$,

If $2\ell+1\le F_k-1$, then the second set ${\rm Ap}(F_i; 1)$ can be yielded by moving to fill the last gap in the line only.

They are valid because for $0\le j\le\ell$,

Next, we shall decide the maximal element in the second set ${\rm Ap}(F_i; 1)$ (and also in the first set ${\rm Ap}(F_i; 0)$).

Case 1 (1) Assume that $r = 0$ and $2\ell+1\le F_k-1$. The second condition is equivalent to $2 F_i\le F_k$, which is equivalent to $i\le k-2$. The largest element in the second set ${\rm Ap}(F_i; 1)$, which is congruent to $\{0, 1, \dots, F_i-1\}\pmod{F_i}$, is given by $t_{2\ell+1, 0} = (2 F_i-1)F_{i+2}$.

Case 1 (2) Assume that $r = 0$ and $2\ell+1\ge F_k$. The second condition is equivalent to $2 F_i-1\ge F_k$, which is equivalent to $i\ge k-1\ge 3$. In this case there are two possibilities for the largest element in the second set ${\rm Ap}(F_i; 1)$: $t_{F_k-1, 0} = (F_k-1)F_{i+2}$ or $t_{2\ell+1-F_k, 1} = (2 F_i-1)F_{i+2}-F_{k-2}F_i$. However, because of $i\ge k-1\ge 3$, always $t_{F_k-1, 0} < t_{2\ell+1-F_k, 1}$.

Case 2 Assume that $r\ge 1$. This condition is equivalent to $F_i-1\ge F_k$, which is equivalent to $i\ge k+1$.

In this case there are four possibilities for the largest element in the second set ${\rm Ap}(F_i; 1)$:

However, it is clear that $t_{2 F_k-1, r-2} < t_{F_k-1, r}$. Because $i\ge k+1$, $t_{F_k+\ell, r-1} < t_{F_k-1, r}$. Thus, the only necessity is to compare $t_{F_k-1, r}$ and $t_{\ell, r+1}$, and $t_{F_k-1, r} > t_{\ell, r+1}$ is equivalent to $(F_i-r F_k)F_{i+2} > F_{k-2}F_i$.

Finally, rewriting the forms in terms of $F_{i+2}$ and $F_{i+k}$ and applying Lemma 1 (2.1), we get the result. Namely, the formula (3.1) comes from Case 1 (1). The formulas (3.2) and (3.3) come from Case 1 (2) when $k = i+1$ and $k = i$, respectively. The general formula (3.4) comes from Case 2.

4.   The case $p=2$

When $p = 2$, we have the following.

Theorem 3. For $i\ge 3$, we have

When $r = \left\lfloor{(F_i-1)/F_k}\right\rfloor\ge 2$, that is, $k\le i-2$, we have

Remark. When $k = i-2$ and $k = i-3$, we can write this more explicitly as

respectively. The formulas (4.7) and (4.8) hold when $r = 2$ and $r = 4$, respectively.

Proof. When $p = 2$, the third least complete residue system ${\rm Ap}(F_i; 2)$ is determined from the second least complete residue system ${\rm Ap}(F_i; 1)$. When $r\ge 2$, some elements go to the third block.

Case 1 (1) Let $r = 0$ and $F_k\ge 3\ell+3 = 3 F_i$. Since for $\ell+1\le j\le 2\ell+1$,

the third set ${\rm Ap}(F_i; 2)$ is given by

As the maximal element is $t_{3\ell+2, 0}$, by (2.1), we have

Case 1 (2) Let $r = 0$ and $2 F_i = 2\ell+2\le F_k\le 3\ell+2 = 3 F_i-1$. Since $t_{j, 0}\equiv t_{\ell+j+1, 0}\pmod{F_i}$ ($\ell+1\le j\le F_k-\ell-2$), and for $0\le j\le 3\ell+2-F_k$,

the third set ${\rm Ap}(F_i; 2)$ is

The first elements $t_{2\ell+1, 0}, \dots, t_{F_k-1, 0}$ are in the last of the first line, and the last elements $t_{0, 1}, , \dots, t_{3\ell+2-F_k, 1}$ are in the first part of the second line. Hence, the maximal element is $t_{F_k-1, 0} = (F_k-1)F_{i+2}$ or $t_{3\ell+2-F_k, 1} = (3 F_i-1)F_{i+2}-F_{k-2}F_i$. Therefore, when $(3 F_i-F_k)F_{i+2}\ge F_{k-2}F_i$, $g_2(F_i, F_{i+2}, F_{i+k}) = (3 F_i-1)F_{i+2}-(F_{k-2}+1)F_i$. When $(3 F_i-F_k)F_{i+2} < F_{k-2}F_i$, $g_2(F_i, F_{i+2}, F_{i+k}) = (F_k-1)F_{i+2}-F_i$.

Case 1 (3) Let $r = 0$ and $F_k\le 2\ell+1 = 2 F_i-1$. Since for $\ell+1\le j\le F_k-1$

and for $0\le j\le 2\ell+1-F_k$

the third set ${\rm Ap}(F_i; 2)$ is

The first elements $t_{2\ell+2-F_k, 1}, \dots, t_{\ell, 1}$ are in the second line of the first block, and the last elements are $t_{F_k, 0}, \dots, t_{2\ell+1, 0}$ in the first line of the second block. So, the maximal element is $t_{\ell, 1} = (F_i+F_k-1)F_{i+2}-F_{k-2}F_i$ or $t_{2\ell+1, 0} = (2 F_i-1)F_{i+2}$. Since $F_k\le 2 F_i-1$, only when $k = i+1$, we have $g_2(F_i, F_{i+2}, F_{i+k}) = (F_i+F_k-1)F_{i+2}-(F_{k-2}+1)F_i$. When $k\le i$, we have $g_2(F_i, F_{i+2}, F_{i+k}) = (2 F_i-1)F_{i+2}-F_i$.

Case 2 (1) Let $r = 1$ and $2\ell+2\le F_k$, that is, $\frac{2}{3}F_i\le F_k\le F_i-1$. This case happens only when $i = 4$ and $k = 3$. Since for $\ell+1\le j\le F_k-1$

for $0\le j\le\ell$

and for $0\le j\le\ell$

the third set ${\rm Ap}(F_i; 2)$ is

The first elements $t_{F_k+\ell+1, 0}, \dots, t_{2 F_k-1, 0}$ are in the first line of the second block, the second elements $t_{F_k, 1}, \dots, t_{F_k+\ell, 1}$ are in the second line of the second block, and the last elements $t_{\ell+1, 2}, \dots, t_{2\ell+1, 2}$ in the third line of the first block. So, the maximal element is one of $t_{2 F_k-1, 0} = (2 F_k-1)F_{i+2}$, $t_{F_k+\ell, 1} = (F_i+F_k-1)F_{i+2}-F_{k-2}F_i$ or $t_{2\ell+1, 2} = (2 F_i-1)F_{i+2}-2 F_{k-2}F_i$. As $i = 4$ and $k = 3$, $t_{2\ell+1, 2} = 34$ is the largest. Hence, $g_2(F_i, F_{i+2}, F_{i+k}) = (2 F_i-1)F_{i+2}-(2 F_{k-2}+1)F_i$, that is, $g_2(F_4, F_6, F_7) = 34-F_4 = 31$.

Case 2 (2) Let $r = 1$ and $2\ell+1\ge F_k$, that is, $(F_i-1)/2 < F_k\le(2F_i-1)/3$. This relation holds only when $k = i-1\ge 4$. Since $t_{j, 1}\equiv t_{F_k+j, 0}\pmod{F_i}$ ($\ell+1\le j\le F_k-1$), $t_{j, 2}\equiv t_{F_k+j, 1}\pmod{F_i}$ ($0\le j\le\ell$), $t_{F_k+j, 0}\equiv t_{\ell+1+j, 2}\pmod{F_i}$ ($0\le j\le F_k-\ell-2$), and for $0\le j\le 2\ell+1-F_k$

the third set ${\rm Ap}(F_i; 2)$ is

So, the maximal element is one of $t_{2 F_k-1, 0} = (2 F_k-1)F_{i+2}$, $t_{F_k+\ell, 1} = (F_i+F_k-1)F_{i+2}-F_{k-2}F_i$, $t_{F_k-1, 2} = (3 F_k-1)F_{i+2}-2 F_{k-2}F_i$ or $t_{2\ell+1-F_k, 3} = (2 F_i-1)F_{i+2}-3 F_{k-2}F_i$. As $k = i-1\ge 4$, $t_{2\ell+1-F_k, 3} = (2 F_i-1)F_{i+2}-3 F_{i-3}F_i$ is the largest. Hence, $g_2(F_i, F_{i+2}, F_{2 i-1}) = (2 F_i-1)F_{i+2}-(3 F_{i-3}+1)F_i$.

Case 3 Let $r\ge 2$. The part

in the second block among the second set ${\rm Ap}(F_i; 1)$ corresponds to the part

in the third block among the third least set ${\rm Ap}(F_i; 2)$^* because

^*When $r = 2$, only the last shorter line remains, and $t_{3 F_k-1, r-3}$ in table 9 does not appear. However, this does not affect the result.

for $0\le j\le F_k-1$ and $1\le h\le r-2$ or $0\le j\le\ell$ and $h = r-1$. The part $t_{\ell+1, r}, \dots, t_{F_k-1, r}$ in the first block among the second set ${\rm Ap}(F_i; 1)$ corresponds to the part $t_{F_k+\ell+1, r-1}, \dots, t_{2 F_k-1, r-1}$ in the second block among the third set ${\rm Ap}(F_i; 2)$ because for $ell+1\le j\le F_k-1$

The part $t_{0, r+1}, \dots, t_{\ell, r+1}$ in the first block among the second set ${\rm Ap}(F_i; 1)$ corresponds to the part $t_{F_k, r}, \dots, t_{F_k+\ell, r}$ in the second block among the third set ${\rm Ap}(F_i; 2)$ because for $0\le j\le\ell$

The first line $t_{F_k, 0}, \dots, t_{2 F_k-\ell-2}, t_{2 F_k-\ell-1}, \dots, t_{2 F_k-1, 0}$ in the second block among the second set ${\rm Ap}(F_i; 1)$ corresponds to two parts $t_{\ell+1, r+1}, \dots, t_{F_k-1, r+1}$ and $t_{0, r+2}, \dots, t_{\ell, r+2}$ in the first block among the third set ${\rm Ap}(F_i; 2)$ because for $0\le j\le F_k-\ell-2$

and for $0\le j\le\ell$,

Hence, the third set ${\rm Ap}(F_i; 2)$ is given by

There are six candidates for the maximal element:

However, it is easy to see that the first four values are less than the last two. Hence, if $(F_i-r F_k)F_{i+2}\ge F_{k-2}F_i$, then $g_2(F_i, F_{i+2}, F_{i+k}) = t_{\ell, r+2}-F_i = (F_i+2 F_k-1)F_{i+2}-\bigl((r+2)F_{k-2}+1\bigr)F_i$. If $(F_i-r F_k)F_{i+2} < F_{k-2}F_i$, then $g_2(F_i, F_{i+2}, F_{i+k}) = t_{F_k-1, r+1}-F_i = \bigl((r+2)F_k-1\bigr)F_{i+2}-\bigl((r+1)+1\bigr)F_{k-2}F_i$.

Finally, we rewrite the form as the linear combination of $F_{i+2}$ and $F_{i+k}$ and apply Lemma 1 (2.1). The formula (4.1) comes from Case 1 (1). The formula (4.2) comes from Case 1 (2). The formulas (4.3) and (4.4) come from Case 1 (3). The formula (4.5) comes from Case 2 (1) (2). The general formula (4.6) comes from Case 3.

5.   The case $p=3$

When $p = 3$, we have the following.

Theorem 4. For $i\ge 3$, we have

When $r = \left\lfloor{(F_i-1)/F_k}\right\rfloor\ge 3$, that is, $k\le i-3$, we have

Proof. When $p = 3$, the fourth least complete residue system ${\rm Ap}(F_i; 3)$ is determined from the third least complete residue system ${\rm Ap}(F_i; 2)$. When $r\ge 3$, some elements go to the fourth block. The proof of the cases $r = 0, 1, 2$ is similar to that of Theorem 3 and needs more case-by-case discussions, and it is omitted.

In the table, denotes the area of the $n$-th least set of the complete residue system ${\rm Ap} (F_i; n-1)$. Here, each $m_j^{(n-1)}$, satisfying $m_j^{(n-1)}\equiv j\pmod{F_i}$ ($0\le j\le F_i-1$), can be expressed in at least $n$ ways, but $m_j^{(n-1)}-F_i$ can be expressed in at most $n-1$ ways. As illustrated in the proof of Theorem 4.1, two areas (lines) of ④ in the first block correspond to the first line of ③ in the third block, two areas (lines) of ④ in the second block correspond to two areas (lines) of ③ in the first block, two areas (lines) of ④ in the third block correspond to two areas (lines) of ③ in the second block, and the area of ④ in the fourth block correspond to the area of ③ in the third block except the first line. Eventually, the maximal element of the fourth set of the complete residue system is from the first block, that is, $t_{F_k-1, r+2} = \bigl((r+3)F_k-1\bigr)F_{i+2}-(r+2)F_{k-2}F_i$ or $t_{\ell, r+3} = (F_i+3 F_k-1)F_{i+2}-(r+3)F_{k-2}F_i$. Hence, if $(F_i-r F_k)F_{i+2}\ge F_{k-2}F_i$, then $g_3(F_i, F_{i+2}, F_{i+k}) = t_{\ell, r+3}-F_i = (F_i+3 F_k-1)F_{i+2}-\bigl((r+3)F_{k-2}+1\bigr)F_i$. If $(F_i-r F_k)F_{i+2} < F_{k-2}F_i$, then $g_3(F_i, F_{i+2}, F_{i+k}) = t_{F_k-1, r+2}-F_i = \bigl((r+3)F_k-1\bigr)F_{i+2}-\bigl((r+2)F_{k-2}+1\bigr)F_i$. Notice that $r\ge 3$ implies that $k\le i-3$.

6.   General $p$ case

Repeating the same process, when $r$ is big enough that $r\ge p$, that is, $k$ is comparatively smaller than $i$, as a generalization of (3.4), (4.6) and (5.3), we can have an explicit formula.

Theorem 5. Let $i\ge 3$ and $p$ be a nonnegative integer. When $r = \left\lfloor{(F_i-1)/F_k}\right\rfloor\ge p$ with $(r, p)\ne(0, 0)$, we have

Remark. When $p = 0$, Theorem 5 reduces to [24,Theorem 1] except $r = 0$.

On the other hand, $k$ is comparatively larger than $i$. As a generalization of (3.1), (4.1) and (5.1), we can also have the following formula.

Proposition 1. For $i, k\ge 3$, we have

when $(p, h) = (3, 4)$, $(4, 4)$, $(5, 5)$, $(6, 5)$, $(7, 5)$, $(8, 5)$, $(9, 6)$, $(10, 6)$, $(11, 6)$, $(12, 6)$, $(13, 6)$, $(14, 6)$, $(15, 7)$, $(16, 7)$, $(17, 7)$, $(18, 7)$, $(19, 7)$, $(20, 7)$, $(21, 7)$, $(22, 7)$, $(23, 7)$, $(24, 8)$, $\dots$.

The proof depends on the fact

Nevertheless, such $h$'s are not necessarily sharp because even if $(p+1)F_i F_{i+2}-F_i-F_{i+2} > F_{2 i+h}$, it is possible to have $g_p(F_i, F_{i+2}, F_{i+k}) = g_p(F_i, F_{i+2})$ ($k\ge i+h$).

7.   Lucas numbers

The formulas about Fibonacci numbers can be applied to obtain those about Lucas numbers. The discussion is similar, though the value $\left\lfloor{(L_i-1)/F_k}\right\rfloor$ is different from $\left\lfloor{(F_i-1)/F_k}\right\rfloor$. So, we list the results only.

When $p = 1$, we have the following.

Theorem 6. For $i\ge 3$, we have

When $r = \left\lfloor{(L_i-1)/F_k}\right\rfloor\ge 1$, that is, $k\le i+1$, we have

When $p = 2$, we have the following.

Theorem 7. For $i\ge 3$, we have

When $r = \left\lfloor{(L_i-1)/F_k}\right\rfloor\ge 2$, that is, $k\le i$ except $i = k = 3$, we have

When $p = 3$, we have the following.

Theorem 8. For $i\ge 3$, we have

When $r = \left\lfloor{(L_i-1)/F_k}\right\rfloor\ge 3$, that is, $k\le i-1$, we have

For general $p$, when $r$ is not less than $p$, we have an explicit formula.

Theorem 9. Let $i\ge 3$ and $p$ be a nonnegative integer. When $r = \left\lfloor{(L_i-1)/F_k}\right\rfloor\ge p$ with $(r, p)\ne(0, 0)$, we have

8.   The number of representations

By using the table of complete residue systems, we can also find explicit formulas of the $p$-Sylvester number, which is the total number of nonnegative integers that can only be expressed in at most $p$ ways. When $p = 0$, such a number is often called the Sylvester number.

8.1.   Main results when $p=1$

When $p = 1$, we have the following.

Theorem 10. For $i\ge 3$, we have

When $r = \left\lfloor{(F_i-1)/F_k}\right\rfloor\ge 1$, that is, $k\le i-1$, we have

Proof. When $r = 0$ and $2\ell+1\le F_k-1$, by $F_i-1 = \ell$,

Hence, by Lemma 1 (2.2), we have

which is (8.1).

When $r = 0$ and $2\ell+1\ge F_k$, by $F_i-1 = \ell$,

Since $F_{i+k} = F_{i+2}F_k-F_i F_{k-2}$,

Hence, by Lemma 1 (2.2), we have

which is (8.2).

When $r\ge 1$, by $F_i-1 = r F_k+\ell$, we have

Hence, by Lemma 1 (2.2), we have

which is (8.3).

8.2.   The case $p=2$

When $p = 2$, we have the following.

Theorem 11. For $i\ge 3$, we have

When $r = \left\lfloor{(F_i-1)/F_k}\right\rfloor\ge 2$, that is, $k\le i-2$, we have

Proof. When $r = 0$ and $F_k\ge 3\ell+3$, by $F_i-1 = \ell$, we have

Hence, by Lemma 1 (2.2), we have

which is (8.4).

When $r = 0$ and $2\ell+2\le F_k\le 3\ell+2$, by $F_{i+k} = F_{i+2}F_k-F_i F_{k-2}$, we have

Hence, we have

This case occurs only when $k = i+2$. Hence, we get (8.5).

When $r = 0$ and $F_k\le 2\ell+1$, we have

Hence, we have

This case occurs only when $k = i+1$. Hence, by rewriting we get (8.6).

When $r = 1$ and $2\ell+2\le F_k$, by $F_i-1 = F_k+\ell$, we have

Hence, we have

This case occurs only when $k = i$. Hence, we get (8.7).

When $r = 1$ and $2\ell+1\ge F_k$, we have

Hence, we have

This case occurs only when $k = i-1$. Hence, after rewriting, we get (8.8).

When $r\ge 2$, by $F_i-1 = r F_k+\ell$, we have

Hence, by Lemma 1 (2.2), we have

which is (8.9).

8.3.   The case $p=3$

When $p = 3$, we have the following. The process is similar, and the proof is omitted.

Theorem 12. For $i\ge 3$, we have

When $r = \left\lfloor{(F_i-1)/F_k}\right\rfloor\ge 3$, that is, $k\le i-3$, we have

8.4.   General $p$ case

We can continue to obtain explicit formulas of $n_p(F_i, F_{i+2}, F_{i+k})$ for $p = 4, 5, \dots$. However, the situation becomes more complicated. We need more case-by-case discussions.

For general $p$, when $r\ge p$, we can have an explicit formula.

Theorem 13. Let $i\ge 3$ and $p$ be a nonnegative integer. When $r = \left\lfloor{(F_i-1)/F_k}\right\rfloor\ge p$, we have

Remark. When $p = 0$, Theorem 13 reduces to [24,Corollary 2].

Sketch of the proof of Theorem 13. We have

Hence, by Lemma 1 (2.2), we have

which is (8.11).

9.   Example

Consider the Fibonacci triple $(F_6, F_8, F_{10})$. Since $F_6-1 = 2 F_4+1$, we see that $r = 2$ and $\ell = 1$. Then, we can construct the first least set, the second least and 3rd, 4th and 5th least sets of the complete residue systems as follows.

Therefore, by Lemma 1 (2.1) with (2.3), we obtain that

By Lemma 1 (2.2) with (2.4), we obtain that

On the other hand, from (3.4), by $(F_6-2 F_4)F_8 > F_2 F_6$, we get

From (4.6) and (5.2), we get

respectively. From (8.3), (8.9) and (8.10), we get

respectively.

10.   Open problems

In ^[31], a more general triple $g(F_a, F_b, F_c)$ is studied for distinct Fibonacci numbers with $a, b, c\ge 3$. In ^[32], the Frobenius number $g(a, a+b, 2 a+3 b, \dots, F_{2k-1}a+F_{2 k}b)$ is given for relatively prime integers $a$ and $b$. Will we be able to say anything in terms of these $p$-Frobenius numbers?

Acknowledgments

The authors thank the anonymous referees for careful reading of this manuscript.

Conflict of interest

The authors declare there is no conflict of interest.