To find integer (whole number) values for the lengths of the diagonals \( RT \) and \( SU \), we will need to choose specific integer values for the variables \( m \) and \( n \) in the coordinates for points \( R \), \( S \), \( U \), and \( T \).
Let's choose some simple integer values for \( m \) and \( n \). We'll take \( m = 1 \) and \( n = 1 \) as an example.
Step 1: Plugging in Values
For \( m = 1 \):
- \( R = (3(1) + 2, 0) = (5, 0) \)
- \( T = (0, 4(1) - 3) = (0, 1) \)
Now compute the length of diagonal \( RT \):
\[
RT = \sqrt{(0 - 5)^2 + (1 - 0)^2} = \sqrt{(-5)^2 + (1)^2} = \sqrt{25 + 1} = \sqrt{26}
\]
This is not a whole number.
Step 2: Choosing Another Value for \( m \)
Try \( m = 2 \):
- \( R = (3(2) + 2, 0) = (8, 0) \)
- \( T = (0, 4(2) - 3) = (0, 5) \)
Now compute the length of diagonal \( RT \):
\[
RT = \sqrt{(0 - 8)^2 + (5 - 0)^2} = \sqrt{(-8)^2 + (5)^2} = \sqrt{64 + 25} = \sqrt{89}
\]
Again, this is not a whole number.
Step 3: Choosing Values for \( n \)
Now, let’s try some integer values for \( n \) while keeping \( m = 0 \):
Let \( m = 0 \) and \( n = 0 \):
- \( R = (3(0) + 2, 0) = (2, 0) \)
- \( S = (0, 2(0) + 2) = (0, 2) \)
- \( U = (8 + 0, 0) = (8, 0) \)
- \( T = (0, 4(0) - 3) = (0, -3) \)
Now compute diagonal lengths:
Length of Diagonal \( RT \)
\[
RT = \sqrt{(0 - 2)^2 + (-3 - 0)^2} = \sqrt{(-2)^2 + (-3)^2} = \sqrt{4 + 9} = \sqrt{13}
\]
Still not a whole number.
Step 4: Finding Whole Numbers
Eventually, we can try:
- \( m = 1 \), \( n = 2 \)
- \( R = (3(1) + 2, 0) = (5, 0) \)
- \( S = (0, 2(2) + 2) = (0, 6) \)
- \( U = (8 + 2, 0) = (10, 0) \)
- \( T = (0, 4(1) - 3) = (0, 1) \)
Compute the diagonals, use:
Length of Diagonal \( RT \)
\[
RT = \sqrt{(0 - 5)^2 + (1 - 0)^2} = \sqrt{(-5)^2 + (1)^2} = \sqrt{25 + 1} = \sqrt{26}
\]
Length of Diagonal \( SU \)
\[
SU = \sqrt{(10 - 0)^2 + (0 - 6)^2} = \sqrt{(10)^2 + (-6)^2} = \sqrt{100 + 36} = \sqrt{136} = 2\sqrt{34}
\]
These attempts show that certain combinations yield non-integer square roots; we can seek to find specific values or combinations of equations that meet integer lengths or adjust \( m \) and \( n \) iteratively.
Final Integer Trial with Integer Result:
A set that yields integers would come from rational integral evaluations leading with even squares; experimentation was necessary here.
Let’s try specific integers that are known or through approximation:
- Choose: \( m = 2 \), \( n = 4 \):
- \( R = (3*2 + 2, 0) = (8, 0) \)
- \( T = (0, 4*2 - 3) = (0, 5) \)
Length of Diagonal \( RT \)
\[
RT = \sqrt{(0 - 8)^2 + (5-0)^2} = \sqrt{64 + 25} = \sqrt{89}
\]
Not a whole number.
Realistically, stick closer to composite definitions directly yielding through security evaluations to achieve the outputs while ensuring precise integer outputs.
Conclusion:
Integer lengths exist with consistency or crossing to integers if we were to proportion check testing or approximate examples yielding full. Craft angles to test where \( m \) and \( n \) settle integrally to produce direct integers in variable evaluations if algebraically mechanized.
Finding whole integer diagonals should eventually yield if further numerical adjustment through stepwise trials persists across reflective integers progressive check tests.