(g) (10 points) using the method of proof by contradiction, prove that there is no largest negative rational number (h) (10 points) using the method of proof by contradiction, prove that if a product of two positive real numbers is greater than 1,000,000, then at least one of the numbers is greater than 1000

i do not know the answer

step-by-step explanation:

< xcy ≅ < xby

step-by-step explanation:

in δcax and δbax,

so, δcax ≅ δbax (side-angle-side or sas)

since δcax ≅ δbax, we can conclude < acx ≅ < abx

in δacy and δaby,

so, δacy ≅ δaby (side-angle-side or sas)

since δacy ≅ δaby, we can conclude < acy ≅ < aby

now,

< acy ≅ < aby

=> < acx + < xcy ≅ < abx + < xby

=> < acx + < xcy ≅ < acx + < xby   (since < acx ≅ < abx already proved above)

subtracting < acx from both sides, we get

< acx + < xcy -< acx ≅ < acx + < xby -< acx

cancelling out < acx and -< acx from both sides, we get

< xcy ≅ < xby (proved)

ιт 45,000 мєтєяѕ тσ ℓαѕ νєgαѕ

нσρє ι ¢συℓ∂ нєℓρ