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

Calculate the gross pay, 1. Simon's monthly take home pay (after taxes) is ...

1. Simon's monthly take home pay (after taxes) is $2200, if he pays 19%  of his gross pay(before taxex) in tax, what is his gross pay? 2 . Convert the following quantities to th

Calculus online, need help completing my online text. can provide login det...

need help completing my online text. can provide login details

Harmonic mean, If a, b and c are in harmonic progression with b as th...

If a, b and c are in harmonic progression with b as their harmonic mean then, b  = This is obtained as follows. Since a, b and c are in

Subtangents & subnormals, show that the subtangent at any point on parabola...

show that the subtangent at any point on parabola y2 =4ax is twice the abscissa at that point.

How much money does she have left, Mary has $2 in her pocket. She does yard...

Mary has $2 in her pocket. She does yard work for four various neighbors and earns $3 per yard. She then spends $2 on a soda. How much money does she have left? This translates

The paperwork to purchase your new home, You recently started the paperwork...

You recently started the paperwork to purchase your new home, and you were just notified that you can move into the house in two weeks. You decide to hire a moving company, but are

Write prim's algorithm, Write Prim's Algorithm.   Ans: Prim's algorithm...

Write Prim's Algorithm.   Ans: Prim's algorithm to find out a minimum spanning tree from a weighted graph in step by step form is given below.  Let G = (V, E) be graph and S

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