6. using proof by contrapositive, prove the following: let n e z2°. if n mod 4 e {2,3}, then n is not a perfect square note: for integers k > 0 and n, the integer n is divided by k. for example, 7 mod 3 is 1. if you are not familiar with called modulus) take a there exists some non-negative integer m such that m2 = n n mod k is defined as the remainder when mod (also quick read through chapter 2.2. an integer n is a perfect square if

she played for 18.75 hours.

step-by-step explanation:

if she played 2/4 of a hour on tuesday. and there is 60 minutes in an hour and 60 divided by 4 is 7.5. and she played 2/4 of an hour on thursday then again 60 divided by 4 is 7.5, you add 7.5+7.5=56.25. now you have to do 1/4 of an hour, it equals 3.75. now you have to add them all up. 3.75+7.5+7.5=18.75

i hope this and i hope you get it right. it took me a while to get this done for you. : )

answer: true

step-by-step explanation:

the answer would be c:   ax + b = ax + c

step-by-step explanation: