91影视

An integer is classified as _odd_ or _even_. These classifications are determined based on divisibility by 2.
An **even number** is any integer that can be expressed in the form of 2k, where k is an integer (e.g., 2, 4, 6,...).
Conversely, an **odd number** is any integer that can be expressed in the form of 2k+1, where k is an integer (e.g., 1, 3, 5,...).
Recognizing these forms is crucial as they are often used in proofs and exercises involving parity.
In our given problem, understanding these forms helps to set up the analysis of the combination of numbers and their sum.

Parity refers to whether an integer is odd or even. There are specific rules governing how parity affects the sum or product of integers:
- The sum of two even numbers is always even: 2k + 2m = 2(k+m).
- The sum of two odd numbers is always even: (2k+1) + (2m+1) = 2(k+m+1).
- The sum of an even number and an odd number is always odd: 2k + (2m+1) = 2(k+m) + 1.
These rules are especially helpful when evaluating sums of multiple integers.
In the context of our problem, we use the rule that an odd number of odd integers leads to an odd sum. This is critical for proving that the sum involving x, y, and z must have at least one odd number.

Proof by contradiction is a technique where we start by assuming the opposite of what we want to prove. If this assumption leads to a contradiction, our original statement must be true.
Here, to prove that at least one of x, y, or z is odd, we assume the opposite: all are even. We expressed x, y, and z as even numbers (x = 2a, y = 2b, z = 2c).
Adding these, we get x+y+z = 2a + 2b + 2c = 2(a+b+c), which is even.
Since this contradicts the given condition that x+y+z is odd, our initial assumption that all three integers are even must be false. Therefore, at least one of x, y, or z must be odd.
This method efficiently demonstrates the truth of our original assertion and is commonly used in mathematical proofs.