Exercise 1.5.1. Finish the following proof for Theorem 1.5.7. Assume B is a countable set. Thus, there exists f : N → B, which is 1–1 and onto. Let A ⊆ B be an infinite subset of B. We must show that A is countable. Let n1 = min{n ∈ N : f(n) ∈ A}. As a start to a definition of g : N → A, set g(1) = f(n1). Show how to inductively continue this process to produce a 1–1 function g from N onto A.

Select the correct answer from the drop-down menu. this graph represents the inequality x+2< 4,2x> 3,x+6< 12,2x> 12

What is the next step in the given proof? choose the most logical approach. a. statement: m 1 + m 2 + 2(m 3) = 180° reason: angle addition b. statement: m 1 + m 3 = m 2 + m 3 reason: transitive property of equality c. statement: m 1 = m 2 reason: subtraction property of equality d. statement: m 1 + m 2 = m 2 + m 3 reason: substitution property of equality e. statement: 2(m 1) = m 2 + m 3 reason: substitution property of equality

Calculate the average rate of change over the interval [1, 3] for the following function. f(x)=4(5)^x a. -260 b. 260 c. 240 d. -240