Assume that f : \mathbb{n} → \mathbb{n} and defined by f(n) = n - 1 for all n > 0 and f(0) = 0.
prove in this case that the function g : p(\mathbb{n}) → p(\mathbb{n}) is injective.
describe the sets g[{0,1,}], g[\mathbb{n}] and g[\mathbb{n} \ {0}].
is the function g surjective? show why.

180

step-by-step explanation:

if a = 1,   and b = 2, then the answer is 47.99999999. if you round that to the nearest whole number, the answer is 48.

step-by-step explanation:

points a and b are equidistant from the desired line, so the line you find by using them will go through point r.

using points other than a and b will give the desired line only if they are equidistant from r. if they are randomly located, the perpendicular line you create will not necessarily go through point r, hence will not be a solution to the problem.