A) how many ways can 2 integers from 1, be selected
so that their sum is even?
b) how many ways can 2 integers from 1, be selected
so that their sum is odd?

Answer with explanation:

→Number of Integers from 1 to 100

                                            =100(50 Odd +50 Even)

→50 Even =2,4,6,8,10,12,14,16,...............................100

→50 Odd=1,3,,5,7,9,..................................99.

→Sum of Two even integers is even.

→Sum of two odd Integers is odd.

→Sum of an Odd and even Integer is Odd.

(a)

Number of ways of Selecting 2 integers from 50 Integers ,so that their sum is even,

   =Selecting 2 Even integers from 50 Even Integers , and Selecting 2 Odd integers from 50 Odd integers ,as Order of arrangement is not Important, ,

=4900 ways

(b)

Number of ways of Selecting 2 integers from 100 Integers ,so that their sum is Odd,

   =Selecting 1 even integer from 50 Integers, and 1 Odd integer from 50 Odd integers, as Order of arrangement is not Important,

=2500 ways

(f - g)(x) = 5x^3 - 3

step-by-step explanation:

rearrange these functions vertically, with like terms in separate columns:

f(x) = 5x^3 - 2

g(x) =         +1

now subtract, column by column:

(f - g)(x) = 5x^3 - 3

i’m here for points.