Answer:
The answer is option A
Step-by-step explanation:
From the question given, the limit is between 5 and 7, the differentiation starts from the beginning of the trail
<span>A. H(w) gets very large. </span>
a. Assume a is even, so a = 2k for some integer k. Now let a and b be integers such that a divides b and a + b is odd.
Since a divides b, b = an for integer n, and in turn b = 2nk, which means <u>b is even</u> and hence a + b is also even. But this contradicts our initial assumption, so a must be odd.
b. Let n be even, so that n = 2k for some integer k. Then
n² = (2k)² = 4k²
so that n² ≡ 0 (mod 4).
Now let n be odd, so n = 2k + 1 for integer k. Then
n² = (2k + 1)² = 4k² + 4k + 1
so that n² ≡ 1 (mod 4).
Therefore n² is never congruent to 2 (mod 4).