1. Introduction
Let denote the set . A
function : is called a
-coloring of the set . If is a system of equations in
variables, then we say that a
solution to is monochromatic if and only
if
In 1916, Schur [1]
proved that for every integer , there exists a least integer such that for every -coloring of the set , there exists a monochromatic
solution to , the integer
is called Schur number. Rado
[2, 3] generalized the
work of Schur to arbitrary system of linear equations and found
necessary and sufficient conditions to determine if an arbitrary system
of linear equations admits a monochromatic solution for every coloring
of the natural numbers with a finite number of colors. For a given
system of linear equations , the least integer , provided that it exists, such that for
every coloring of the set
with colors, there exists a
monochromatic solution to , is called -color Rado number. If such an integer
does not exist, then the -color Rado number for the system is infinite. In recent years
there has been considerable interest in finding the exact Rado numbers
for particular linear equations and in several other closely related
problems, see for example [4, 5, 6, 7, 8, 9, 10, 11, 12].
For positive integer and
equations , where
, the -color off-diagonal Rado number is the
least integer provided that it
exists for which any -coloring of
must admit a monochromatic
solution of color to for some . Note that if for all ,
, then the -color off-diagonal Rado number is the
-color Rado number. Robertson and
Schaal [13] gave some
2-color off-diagonal Rado numbers for particular linear equations. In
[14], Mayers and Robertson
gave the exact -color off-diagonal
Rado numbers when the two equations are of the form and . They showed that and for , Motivated
by Myers and Robertson’s work, Yao and Xia [15] proved the following results: and
In this paper, we are also interested in precise values of -color off-diagonal Rado numbers and let
denote it. Let blue and red be the two colors
and denoted by 0 and 1, respectively. We determine the exact numbers
, where are odd integers and . The main results of this
paper can be stated as follows.
Theorem 1. For odd integers and , we have
Theorem 2. For odd integer , we have
2. Lower Bounds
Lemma 1. For odd integers and , we have
Proof. Let , consider the
2-coloring of defined by
coloring red and its complement blue. Now, we show that
there is no suitable red solution to and no suitable blue solution to
. Assume that is a red solution to
. Note that since . If , then there exist
integers and such that , and . Thus, . The fact that is an odd integer implies that and . However, which is a contradiction and therefore
. If , then which is a contradiction and
hence, . If , we see that which is a contradiction and thus, . Note that and are all odd, therefore, , i.e., . Recall that is odd, therefore, and . However,
which is a contradiction, and there is no suitable red solution to .
Assume that
is a blue solution to .
Note that must be even this
is because is an odd integer.
Therefore and which implies that must be even. If , then , that is, . Therefore, and . However,
which is a contradiction. If , then which is a contradiction. Thus,
there is no suitable blue solution to . The proof is complete. 
Lemma 2. For odd integer , we have
Proof. Let be
colored blue and be
colored red. It is easy to verify that there is no suitable blue
solutions to and no
suitable red solution to . 
3. Proof of Theorem 1
It follows from Lemma 1 that where
are odd integers and .
In order to prove this theorem, it suffices to show that where are odd integers and . Let be a
2-coloring of using the colors red and blue.
Without loss of generality, we assume, for contradiction, that there is
no blue solution to and no
red solution to . We break
the argument into 4 cases;
- Case 1: and .
and imply that , otherwise is a blue solution to . Since , we must have or else
is a
red solution to . Now,
and
, so ,
otherwise
is a blue solution to .
Note that since . and imply that , otherwise is a red
solution to . Since and , we must have or else is a blue solution to . If , then is a red solution to , so we may assume that . If , then is a blue solution to , so we may assume that . Now, and , we must have or else is a red solution to . and , imply that , otherwise is a blue solution to . Since and , we must have or else is a red solution to . If , then is a blue solution to , so we may assume that . If , then is a red solution to , so we may assume that . Since and , we must have or else is a blue solution to . and imply that , otherwise is a red solution to . Now we have , and , and then is a blue solution to , which is a
contradiction.
- Case 2: and .
If
and then is a blue
solution to , which is a
contradiction. So we can assume that is the least number such that and .
- Subcase 1: .
and implies that , otherwise is a red solution to . Since and , we must have or else is a blue solution to
. and imply that , otherwise is a red solution to
. If , then is a blue solution to , so we may assume that . If then is a red solution to
, so we may assume that
. Note that
since . Since and , we must have , otherwise is a blue solution to
. and imply that or else is a red solution to . If , then is a blue solution to , so we may assume that . Since and , we must have or else is a red solution to . If , then is a blue solution to , so we may assume that . If , then is a red solution to , so we may assume that . and imply that or else is a red solution to . Since and , we must have or else is a blue solution to . and imply that , otherwise is a red solution to . and imply that , otherwise is a blue solution to . Since and , we must have or else is a red solution to . When , by the above proof, we have and , then , otherwise is a red solution to
. implies that or else is a blue solution to . Since and , we must have , otherwise is a red solution to . Now we have , and , and then is a blue solution to , which is a contradiction. When
, since and , we must have , otherwise is a blue solution to . Note that
since . and imply that or else is a red solution to . Now we have , and , and then is a blue solution to , which is a
contradiction.
- Subcase 2: .
It is easy to verify that and Thus, and , and we have .
Obviously, and , then , otherwise is a blue solution to . Since and , we must have or else is a blue solution to . and imply that , otherwise is a red solution to
. Now we have , and , and then is a blue solution to
, which is a
contradiction.
- Case 3: and .
If ,
then is a red solution
to , which is a
contradiction. So we can assume that () is the least integer such that and .
- Subcase 1: .
implies that , otherwise is a red solution to . If , then is a blue solution
to , so we may assume that
. If , then is a red
solution to , so we may
assume that .
Note that since . and imply that , otherwise is a blue
solution to . Since and , we must have or else is a red solution to . and imply that , otherwise is a blue solution to . If , then is a red solution to , so we may assume that . If , then is a blue solution to , so we may assume that . Now, and , we must have or else is a red solution to . If , then is a blue solution to , so we may assume that . Since and , we must have or else is a red solution to
. Since and , we must have , otherwise is a blue solution to . and imply that , otherwise is a red solution to . If , then is a blue solution to , so we may assume that . When , then , by the above proof, we have and , then , otherwise is a red solution to . Now we have and , so is a blue solution to , which is a contradiction. When
and , implies that , otherwise is a blue solution to . Since and , we must have or else is a red solution to . If , then is a blue solution to , so we may assume that . If , then is a red solution to , so we may assume that . Now we have , and , so is a blue solution to , which is a contradiction. When
, we see that Since and , then or else is a red solution to
. If , then is a blue solution to . Since and , we must have , otherwise is a red solution to . and imply that or else is a red solution to . Since and , then , otherwise is a blue solution to . If , then is a red solution to , so we may assume that . If , then is a blue solution to . Since and , we must have , otherwise is a red solution to . Now we have , and , so is a blue solution to , which is a
contradiction.
- Subcase 2: .
We have and . Note that and , thus, . Since and , we must have and or else and are red solutions to . When , since and , then , otherwise is a blue solution
to . If , then is a blue solution to
, so we may assume that
. Now we have , and , thus is a red solution to
, which is a contradiction.
When , note that , so . If , then is a red solution to , so we may assume that . Since and , we must have or else is a blue solution
to . implies that , otherwise is a red solution to . If , then is a blue solution to
, so we may assume that
. Now we have
, and , so is a red solution
to , which is a
contradiction.
- Case 4: and .
Since , we
must have and or else and are red solutions to . If , then is a blue solution to , so we may assume that . If , then is a red solution to
, so we may assume that
. Since and , we must have , otherwise is a blue solution to
. and imply that , otherwise is a red solution to . implies that , otherwise is a blue solution to . If , then is a red solution to
, so we may assume that
. If , then is a blue solution to
, so we may assume that
. If , then is a red solution to
, so we may assume that
. Since and , we must have , otherwise is a blue solution to . and imply that or else is a red solution to . Since and , we must have or else is a blue solution to . Note that
since and . and imply that , otherwise is a red solution to
. If , then is a blue solution to , so we may assume that . If , then is a red solution to , so we may assume that . If , then is a blue solution to , so we may assume that . If , then is a red solution to
, so we may assume that
. Now we have , and , so is a blue solution to , which is a contradiction and
the proof is complete.
0
4. Proof of Theorem 2
It follows from Lemma 2 that when is an odd integer, In order
to prove this theorem, it suffices to show that when is an odd integer, Let
be a 2-coloring of using the colors red and blue.
Without loss of generality, we assume, for contradiction, that there is
no blue solution to and no
red solution to . We break
our proof into 3 cases.
- Case 1: .
Since , then the
solution to forces and the solution to forces . Since , then the solution to forces . Since and , then the solution to forces . Now we have , so
is a blue solution to
, which is a
contradiction.
- Case 2: and .
implies that or else is a red solution to . Since and , we must have , otherwise is a blue solution to . If , then is a red solution to , so we may assume that . If , then is a blue solution to , so we may assume that . If , then is a red solution to , so we have . Now we have and , so is a blue solution to , which is a
contradiction.
- Case 3: .
implies that , otherwise is a blue solution to . If , then is a blue solution to , so we may assume that . Since and , we must have , otherwise is a red solution to . and imply that , otherwise is a blue solution to . Now we have and , so is a red solution to
, which is a contradiction
and this completes the proof.
0
Acknowledgments
We thank the anonymous referees for their helpful comments.