91Ó°ÊÓ

An integer, by definition, is any number in the continuous, infinite set of whole numbers that can be positive, negative, or zero. Within this set, integers are classified as either even or odd based on their divisibility by 2. An even integer can be defined as any integer that is divisible by 2 without leaving a remainder. To put it mathematically, an integer \(n\) is even if there exists another integer \(k\) such that \(n = 2k\). On the other hand, an odd integer cannot be evenly divided by 2. In terms of an equation, an integer \(n\) is odd if it can be expressed as \(2k + 1\) where \(k\) is an integer. This understanding is crucial because it forms the basis of many mathematical proofs and operations, particularly those involving division and multiplication by integers.

Understanding the distinction between even and odd numbers is not just a matter of definition. It has practical implications in various areas of mathematics, including algebra, number theory, and even computer science. When we're dealing with proofs, the property of being even or odd can often reveal important clues about the behavior of mathematical expressions, as in the case of the exercise we're discussing, where the parity of the integer \(n\) determines whether 4 can divide \(n^2\) without a remainder.

When we say that one integer divides another, we mean that when the first integer (the divisor) divides the second (the dividend), the result is a third integer (the quotient) with no remainder. This concept of division is at the core of many mathematical theorems and problems. Returning to our example, the statement that '4 divides \(n^2\)' is to claim that there is some integer \(m\) that satisfies the equation \(n^2 = 4m\).

To understand this better, let us delve into the properties of squares of integers. The square of an even integer is always even because it can be expressed in the form \(4k^2\), which is clearly a multiple of 4, as seen in the step-by-step solution. Conversely, the square of an odd integer is always odd because \( (2k+1)^2 = 4(k^2 + k) + 1 \) - note how the result is one more than a multiple of 4, thus rendering the expression odd and indivisible by 4. Mastery of these concepts allows us to not only solve problems that directly ask whether an integer is divisible by another but also to explore deeper implications in various branches of mathematics.

Proof by implication is a logical argument used to establish the truth of a statement by showing that if one thing is true, then another must necessarily follow. It is a form of conditional reasoning, often used in mathematics, that takes the form 'if A, then B.' The proof involves two main parts: proving that if A is true B cannot be false (called the direct implication), and proving that if B is false A cannot be true (called the contrapositive).

In the context of our exercise, we employed proof by implication when we showed that an integer being even directly implies that 4 divides its square (step 1), and also that the square being divisible by 4 implies that the integer is even (step 2). By proving both these implications, we affirm the bidirectional conditional statement that 'an integer \(n\) is even if and only if 4 divides \(n^2\).' The use of implications in proofs enables us to establish relationships between statements that appear disconnected at first glance, thus allowing for deeper insights and broader applications in mathematics.