assuming the fact that every infinite set contains a denumerable subset, prove the following: every infinite set is equivalent to one of its proper subset.
(hint: prove this first for a denumerable set a, i. e. prove that there is an injective function f: a? a that is not surjective. then the range would be a denumerable proper subset of a. for a general infinite set b which contains a denumerable subset a, define a function g: b? b such that g|a=f and g|ac=idac. is gg injective? is g surjective? )

the answer is 844

step-by-step explanation:

it is 844 because if you add 836.50 + 7.5 you will get 844

options a,b,c are the right answer.

step-by-step explanation:

a linear parent function is always represented as y = x

if we write this function in the form of y=mx+c

⇒

or  

now if we plot a graph we will find these characteristics:

1) y intercept of the graph is zero so its a straight line passing through origin.

2) as we can see in both the forms of function written, values of x and y may be either positive or negative for the positive slope means points on the graph are either in first quadrant or in third one.

3) it's slope is one.

addition

step-by-step explanation: