Final Exam Practice for Mathematical Proofs
Uploaded by
Sanjana BulusuFinal Exam Practice for Mathematical Proofs
Uploaded by
Sanjana BulusuCommon questions
Powered by AITo prove that (A + B)^2 ≥ A^2 + B^2 for non-negative real numbers A and B, expand both sides of the inequality. The left side becomes A^2 + 2AB + B^2. Since 2AB ≥ 0 for non-negative A and B, it follows that A^2 + 2AB + B^2 ≥ A^2 + B^2, thus proving the inequality .
To prove that x_n = 2^n + 3^(n-1) satisfies the recursion x_n+1 = 5x_n - 6x_n-1, use induction. Base cases: x_1 = 2^1 + 3^0 = 3, x_2 = 2^2 + 3^1 = 7. Assumption: assume true for n, then x_n+1 = 5(2^n + 3^(n-1)) - 6(2^(n-1) + 3^(n-2)), simplifying results in 2^(n+1) + 3^(n) validating the hypothesis for n+1, completing the induction .
The equivalence class of 33 under congruence mod 7 contains all integers that give the same remainder when divided by 7 as 33 does. Since 33 ≡ 5 (mod 7), this equivalence class consists of {..., -9, -2, 5, 12, 19, ...}. There are 7 distinct equivalence classes under congruence mod 7, corresponding to possible remainders: 0, 1, 2, 3, 4, 5, and 6 .
The statement is false. If f: A∪B → C is such that A and B are disjoint sets, and f is injective on each, it does not imply that f is injective on the entire domain A ∪ B. Injectivity requires that distinct inputs must yield distinct outputs. If there's any c ∈ C that is an image of elements from both A and B under f with different preimages, then f would not be injective .
To prove the inequality √2x ≤ 1 + x^2 for x ≥ 0, one can use the method of squaring both sides of the inequality. This transforms it into 2x ≤ (1 + x^2)^2, which simplifies to checking if 2x ≤ 1 + 2x^2 + x^4 holds for x ≥ 0. By analyzing the sign of the expression 1 + 2x^2 + x^4 - 2x ≥ 0, we can verify its validity through critical points or directly examining the function behavior .
The function f: Z → Z × N is defined as f(n) = (-n, n^2 + 1). The function g: Z × N → Q is defined as g(n, m) = n/m. For g ◦ f to be injective, the output of the composition should uniquely determine the input. Analyzing g(f(n)), we find g(f(n)) = -n/(n^2 + 1). If g ◦ f is injective, -n/(n^2 + 1) must be unique for each n, which holds since each value of n produces a unique rational number due to the strict form of the expression .
f(x) = x + 1/x is surjective because every value in (−∞, −2] ∪ [2, ∞) can be obtained by choosing appropriate x. To see why it isn't injective, consider the outputs y = 3 and y = -3, both of which can be achieved with different x-values (e.g., x = 1/2 and x = 2 for y = 3), showing that f(x) is not one-to-one for all x in the domain .
To use contrapositive reasoning, prove that if x ≥ 3, then x³ + 5x ≠ 40. For x ≥ 3, consider x = 3, then x³ + 5x = 27 + 15 = 42, which is not 40. For x > 3, x³ grows faster than the linear term can reduce; therefore, x³ + 5x > 42, which is not equal to 40, thus proving the contrapositive and consequently the original statement .
The equation (A \ B) ∪ (B \ A) results in a set that is uncountable and infinite. This is because both A \ B and B \ A involve subtracting a subset which individually remains uncountable if A and B are distinct and initially uncountable. Thus, the union maintains the uncountable nature, as it effectively captures elements not shared by A and B .
The equation cx^2 + x - c = 0 has two distinct solutions if its discriminant is positive. The discriminant is given by Δ = (1)^2 - 4(c)(-c) = 1 + 4c^2. To ensure two distinct solutions, 1 + 4c^2 > 0 must hold true, which is always true for any nonzero c. Therefore, all non-zero real values of c satisfy the condition .