Find the largest possible positive integer, Mathematics

Assignment Help:

Find the largest possible positive integer that will divide 398, 436, and 542 leaving remainder 7, 11, 15 respectively.

(Ans: 17)

Ans: The required number is the HCF of the numbers

Find the HCF of 391, 425 and 527 by Euclid's algorithm

∴ HCF (425, 391) = 17

Now we have to find the HCF of 17 and 527

527 = 17 ? 31 +0

∴ HCF (17,527) = 17

∴ HCF (391, 425 and 527) = 17

 


Related Discussions:- Find the largest possible positive integer

Polar to cartesian conversion formulas, Polar to Cartesian Conversion Formu...

Polar to Cartesian Conversion Formulas x = r cos Θ y = r sin Θ Converting from Cartesian is more or less easy.  Let's first notice the subsequent. x 2 + y 2   = (r co

Solve cos( 4 ) = -1 trig function, Solve cos( 4 θ ) = -1 . Solution ...

Solve cos( 4 θ ) = -1 . Solution There actually isn't too much to do along with this problem.  However, it is different from all the others done to this point.  All the oth

Arc length and surface area revisited, Arc Length and Surface Area Revisite...

Arc Length and Surface Area Revisited We won't be working any instances in this part.  This section is here exclusively for the aim of summarizing up all the arc length and su

Help, sin(x)+cos(x)

sin(x)+cos(x)

What is the probability that |x| < 2 , A number x is chosen at random ...

A number x is chosen at random from the numbers -3, -2, -1, 0 1, 2, 3. What is the probability that  | x| Ans :    x  can take 7 values To get |x| Probability (| x |

Limit problem, limit x-a/|x-a| equals x-a [a]a [b]0 [c]-a [d]none 0f these

limit x-a/|x-a| equals x-a [a]a [b]0 [c]-a [d]none 0f these

Idk, Are you suppose to divide the 1 or subtract

Are you suppose to divide the 1 or subtract

Steel bar to make a hard surface, Take the carburizing of a steel bar to ma...

Take the carburizing of a steel bar to make a hard surface. To obtain the desired hardness, we require to control the diffusion of carbon into the surface and the phases obtained d

Linear programming , Use the simplex method to solve the following LP Probl...

Use the simplex method to solve the following LP Problem. Max Z = 107x1+x2+2x3 Subject to 14x1+x2-6x3+3x4=7 16x1+x2-6x3 3x1-x2-x3 x1,x2,x3,x4 >=0

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd