Euclid divisiomn algorithm problems


Problems
1)   prove that          a³+2a/(a⁴+3a²+1)
is reducible
solution
The fraction is reduciblevif and only if its reciprocral is reducible

its reciprocal is
(a⁴+3a²+1)/a³+2a  = a + (a²+1)/a³+2a
simplyfying the problem to provide irreducibility of 
(a²+1)/a³+2a
which is reducible if and only if
a³+2a/(a²+1)
Continuing the process again and again we come to the point 
1/a which is irreducble
hence proved.

No comments:

Post a Comment

For any queries drop a mail at: teammathfreaks@gmail.com