Aratati ca fractia 2n+7/n+3 este ireductibila

According to Euclidean's algorithm:

GCD(a, b) = GCD(a-b, b), a > b

GCD(a, b) = GCD(a, b-a), b > a

GCD(2n+7, n+3) = GCD(2n+7-n-3, n+3)  = GCD(n+4, n+3) =

= GCD(n+4-n-3, n+3) = GCD(1, n+3) = 1

⇒ The fraction is irreductible.

- both graphs increase on their domain.

- the graphs of both functions have the same x-intercept.

- neither graph has a y-intercept.

answer: cos [   arcsin (3/5) - arccos (1/2) ] =

step-by-step explanation: × = 3/5 = 0.6--> x = 36.87 and x = 180 - 36.87 = 143.13 deg

cos y = 1/2 --> y = +- 60 deg a. cos (x - y) = cos (143.13 - 60) = cos 83,13  

=

0.12

b. cos (36.87 - 60) = cos (-23.23) = 0.92