Find the largest possible positive integer, Mathematics

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

 

Posted Date: 4/8/2013 1:04:38 AM | Location : United States







Related Discussions:- Find the largest possible positive integer, Assignment Help, Ask Question on Find the largest possible positive integer, Get Answer, Expert's Help, Find the largest possible positive integer Discussions

Write discussion on Find the largest possible positive integer
Your posts are moderated
Related Questions
(a) Derive the Marshalian demand functions for the following utility function: u(x 1 ,x 2 ,x 3 ) = x 1 + δ ln(x 2 )       x 1 ≥ 0, x 2 ≥ 0 Does one need to consider the is

a die was rooled 500 times and number of times 4 came up was noted if the imperical probability calculated from this information 7_10

A train goin from delhi to jaipur stops at 7 intermediate stations. 5 persons enter the train during the journey with 5 difefrent tickets of same class . How mant different set of

who created math?

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


Statistical inference This is the process of drawing conclusions about attributes of a population based upon information contained in a sample or taken from the population.

If sin? =  1/2 , show that 3cos?-4cos 3 ? = 0. Ans:    Sin ? = ½ ⇒ ? = 30 o Substituting in place of ? =30 o . We get 0.

(a) An unordered pair fm; ng with 1 ≤ m ≠ n ≤ 6 is called a duad. List the 15 duads. (b) There are 15 ways to partition {1, ......, 6 } into 3 duads, such as { {1; 2}, {3, 4},