This action might not be possible to undo. Are you sure you want to continue?

BooksAudiobooksComicsSheet Music### Categories

### Categories

### Categories

### Publishers

Scribd Selects Books

Hand-picked favorites from

our editors

our editors

Scribd Selects Audiobooks

Hand-picked favorites from

our editors

our editors

Scribd Selects Comics

Hand-picked favorites from

our editors

our editors

Scribd Selects Sheet Music

Hand-picked favorites from

our editors

our editors

Top Books

What's trending, bestsellers,

award-winners & more

award-winners & more

Top Audiobooks

What's trending, bestsellers,

award-winners & more

award-winners & more

Top Comics

What's trending, bestsellers,

award-winners & more

award-winners & more

Top Sheet Music

What's trending, bestsellers,

award-winners & more

award-winners & more

P. 1

Number System|Views: 154|Likes: 7

Published by nukalasubbu

See more

See less

https://www.scribd.com/doc/36503979/Number-System

11/08/2010

text

original

:-----------------------

am dividing this method into four parts and we will discuss each part one by one: a. b. c. d. Last Last Last Last two two two two digits of digits of digits of digits of numbers numbers numbers numbers which which which which end end end end in in in in one 3, 7 and 9 2 4, 6 and 8

Before we start, let me mention binomial theorem in brief as we will need it for our calculations.

Last two digits of numbers ending in 1 Let's start with an example. What are the last two digits of 31786 ? Solution: 31 786 = (30 + 1)786 = 786 C0 × 1 786 + 786 C1 × 1 785 × (30) + 786 C2 × 1 784 × 302 + ..., Note that all the terms after the second term will end in two or more zeroes. The first two terms are 786 C0 × 1 786 and 786 C1 × 1 785 × (30). Now, the second term will end with one zero and the tens digit of the second term will be the product of 786 and 3 i.e. 8. Therefore, the last two digits of the second term will be 80. The last digit of the first term is 1. So the last two digits of 31786 are 81. Now, here is the shortcut:

Here are some more examples: Find the last two digits of 412789 In no time at all you can calculate the answer to be 61 (4 × one will be the units digit) Find the last two digits of 7156747 Last two digits will be 91 (7 × 7 gives 9 and 1 as units digit) 9 = 36). Therefore, 6 will be the tens digit and

Now try to get the answer to this question within 10 s: Find the last two digits of 51456 × 61567

The last two digits of 51456 will be 01 and the last two digits of 61567 will be 21. Therefore, the last two digits of 51 456 × 61567 will be the last two digits of 01 × 21 = 21 Last two digits of numbers ending in 3, 7 or 9 Find the last two digits of 19266 .

the last two digits of 76 × 2 7 will be the last two digits of 27 = 28) Same method we can use for any number which is of the form 2n . By the previous method. then you can straightaway write the last two digits of 2n because when 76 is multiplied with 2n the last two digits remain the same as the last two digits of 2n . Here is an example: Find the last two digits of 64236 . Also.e. 192 ends in 61 (192 = 361) therefore. 87 474 = 87472 × 87 2 = (874 ) 118 × 87 2 = (69 × 69)118 × 69 (The last two digits of 872 are 69) = 61118 × = 81 × 69 = 89 If you understood the method then try your hands on these questions: Find the last two digits of: 1. we need to find the last two digits of 2172 .19 266 = (192 ) 133 . Therefore. so the tens digit will be 8 and last digit will be 1) Find the last two digits of 33288 . We know that 242 ends in 76 and 210 ends in 24. 64 236 = (2 6 ) 236 = 2 1416 = (2 10 ) 141 × 2 6 = 24141 (24 raised to odd power) × 64 = 24 × 64 = 36 . our purpose is to get 76 as last two digits for even numbers. Therefore. The last two digits are 81 (6 × 3 = 18. 27456 2. Therefore. Let's apply this funda: Find the last two digits of 2543 . 4. 7 and 9: Now try the method with a number ending in 7: Find the last two digits of 87474 . 76 raised to any power gives the last two digits as 76. 2 543 = (2 10 ) 54 × 2 3 = (24)54 (24 raised to an even power) × 2 3 = 76 × 8 = 08 (NOTE: Here if you need to multiply 76 with 2n . the last two digits of 2172 = 41 (tens digit = 2 × 2 = 4. 2434 will end in 76 and 2453 will end in 24. unit digit = 1) So here's the rule for finding the last two digits of numbers ending in 3. 33 288 = (334 ) 72 . 7983 3. 24 raised to an even power always ends with 76 and 24 raised to an odd power always ends with 24. Now 334 ends in 21 (334 = 332 × 33 2 = 1089 × 1089 = xxxxx21) therefore. we need to find the last two digits of (61)133 . 6 or 8 There is only one even two-digit number which always ends in itself (last two digits) . 583512 69 Last two digits of numbers ending in 2. Now. Once the number is ending in 1 we can straight away get the last two digits with the help of the previous method.76 i.

is free of D.. Find the last two digits of 56283 . N 2 ... only the product R 1 R 2 R 3 . respectively. N 2 . We can find the last two digits of both the parts separately. Therefore N N N 2 1 1 . give quotients Q when divided by a common divisor D.. R 2 . Here are some examples: Find the last two digits of 62586 .. R 3 .(1) In the above equation. Q 3 . .Now those numbers which are not in the form of 2n can be broken down into the form 2n v odd number. and so on.. 56 283 = (2 3 × 7) 283 = 2 849 × 7 283 = (2 10 ) 84 × 2 9 × (7 4 ) 70 × 7 3 = 76 × 12 × (01) 70 × 43 = 16 Find the last two digits of 78379 ... 54 380 = (2 × 3 3 ) 380 = 2 380 × 3 1140 = (2 10 ) 38 × (3 4 ) 285 = 76 × 81285 = 76 × 01 = 76. 78 379 = (2 × 39)379 = 2 379 × 39379 = (2 10 ) 37 × 2 9 × (39 2) 189 × 39 = 24 × 12 × 81 × 39 = 92 Now try to find the last two digits of 1. 1 N 3 2 N 3 . N 3 . R 2 R . = D × Q = D × Q 2 . 1 3 3 3 Let P be the product of N Therefore.. Q 2 . N 2 . = (D × Q + R 1 )(D × Q 2 + R 2 )(D × Q 3 + R 3 ). where K is some number ---.. N 3 . P = N = D × K + R 1 1 . 62 586 = (2 × 31)586 = 2 586 × 3 586 = (2 10 ) 58 × Find the last two digits of 54380 . therefore the remainder when P is divided by D is the remainder when the product R 1 R 2 R 3 . and remainders R 1 .. Let S be the sum of N 1 ... is divided by D.... = D × Q + R + R 2 1 + R 1 .. 28287 2 6 × 31586 = 76 × 64 × 81 = 84 2)REMAINDERS:--------------------- Suppose the numbers N 1 .. . 34576 2. N 3 .

(8 times) × 7 = 343 × 343 × 343.. (668 times). + R 2 + R 3 is divided by D. = D Ã² K + R 1 + R + R 3 . Since 2 is a number less than 7 we try to convert the product into product of numbers higher than 7..Therefore... (8 times) × 7 is divided by 9. S = (N = (D × Q 1 1 ) + (N 2 ) + (N 2 3 ) +. Hence the final remainder is the remainder when the product 3 × 4 × 5 = 60 is divided by 7.. Therefore we convert the product in the following manner2 2004 = 8 668 = 8 × 8 × 8. Notice that 8 = 2 × 2 × 2. Hence the remainder when 8 by 7 Answer = 1 3.. (8 times) × 7. Answer = 4 2. The remainder when 8 is divided by 7 is 1. Hence the remainder when 25 25 is divided by 9 is 7. 4..25 times = 18K + 7 25 Hence remainder when 25 Now 7 25 is divided by 9 is the remainder when 7 25 is divided by 9. Again 25 What is the remainder when 25 25 25 is divided by 9? 25 = (18 + 7) 25 = (18 + 7)(18 + 7). And 4 gives a remainder of 4 only when divided by 7.. where K is some number--. (2004 times)). 8 668 gives the remainder 1 when divided by 7 as we have seen in the previous problem. Answer = 4 4.. What is the remainder when 2 2006 668 is divided by 7 is the remainder obtained when the product 1 × 1 × 1. 1999.. The remainder is 7 in this case. What is the remainder when 2 2004 is divided by 7? 2 2004 is again a product (2 × 2 × 2. = 7 3 × 7 3 × 7 3 ... Now. What is the remainder when the product 1998 × 1999 × 2000 is divided by 7? Answer: the remainders when 1998. Hence the remainder when 2 2006 is divided by 7 is the remainder when the product 1 × 4 is divided by 7. except that 2006 is not an exact multiple of 3 so we cannot convert it completely into the form 8 x . . Hence the remainder when 7 25 is divided by 9 is the remainder we obtain when the product 1 × 1 × 1.. is divided is divided by 7? This problem is like the previous one. and 2000 are divided by 7 are 3. The remainder when 343 is divided by 9 is 1 and the remainder when 7 is divided by 9 is 7.(2) 1 Hence the remainder when S is divided by D is the remainder when R Examples: 1.... 3 + R 1 ) + (D × Q 2 + R 2 ) + (D × Q + R 3 ). and 5 respectively... We will write it in following manner2 2006 = 8 668 × 4.

Hence to find the remainder when both the dividend and the divisor have a factor in common. 1 Hence A = B × Q + R 1 . For example. N = Q × D + R. The remainder when 15 is divided by 16 is 15 the first case and -1 in the second case.1B THE CONCEPT OF NEGATIVE REMAINDER 15 = 16 × 0 + 15 or 15 = 16 × 1 .1A When both the dividend and the divisor have a factor in common. Take out the common factor (i. it means that the number gives a remainder of 23 2 = 21 with 23.D. Putting the value of A in the previous equation and comparing we getk(B × Q 1 + R 1 ) = Q × kB + R --> R = kR 1 . Answer = 64 2. EXAMPLE . o o o Examples 5. is divided by 3 is 2. What the remainder when 2 96 96 is divided by 96? 5 The common factor between 2 and 96 is 32 = 2 .1. Let N be a number and Q and R be the quotient and the remainder when N is divided by the divisor D. when a number gives a remainder of -2 with 23. Hence kA = Q × kB + R. Hence the real remainder will be 2 multiplied by common factor 32. it gives a negative remainder of R . Hence. the remainder when 15 is divided by 16 is 15 or -1.e. Let N = k × A and D = k × B where k is the HCF of N and D and k > 1. 91 Removing 32 from the dividend and the divisor we get the numbers 2 The remainder when 2 91 and 3 respectively. 1 ).Some Special Cases: 2. --> When a number N < D gives a remainder R (= N) when divided by D. Hence. divide the numbers by the common factor) Divide the resulting dividend (A) by resulting divisor (B) and find the remainder (R The real remainder R is this remainder R1 multiplied by the common factor (k). Let Q 1 and R 1 be the quotient and the remainder when A is divided by B.

Find the remainder when 7 52 52 is divided by 2402. .1) = 2402K + (-1) 13 = 2402K .1 = (20 2004 .1 2004 is divisible by 17 (Theorem 2). + (3) 5555 = (4 1111 2 ) 1111 + (3 5 ) 1111 = (16) 1111 + (243) 1111 Now (16) 1111 + (243) is divisible by 16 + 243 or it is divisible by 259.3 2004 . which is a multiple of 7. + 4 4 333 = (3 4 ) 3 111 + (4 3 ) .3 2004 ). Answer: The remainders when 5555 and 2222 are divided by 7 are 4 and 3 respectively. the problem reduces to finding the remainder when (4) Now (4) 2222 2222 What is the remainder when (5555) 2222 + (2222) 5555 is divided by 7? + (3) . 20 2004 + 16 2004 . Answer: The dividend is in the form a 3 444 x What is the remainder when 3 444 + 4 333 is divided by 5? + b 111 y .3 2004 .1C When dividend is of the form a n + b n or a n .1 2004 ).3 2004 is divisible by 17 (Theorem 3) and 16 .1. 2222 Hence the remainder when (5555) 9. 20 2004 + (2222) 5555 is divided by 7 is zero. Hence the complete expression is divisible by 17. + 16 2004 .6. the remainder is 0.1 = 2401. Hence.3 2004 ) + (16 2004 2004 . 5555 is divided by 7. Hence. the remainder when 7 Answer: 2401.1 = (20 2004 .b n : EXAMPLES 7.3 2004 . Since the number is divisible by 145 it will certainly be divisible by 5.1 is divisible by: (a) 317 (b) 323 (c) 253 (d) 91 Solution: 20 Now 20 2004 2004 + 16 2004 . 13 Answer: 7 = (7 4 ) 13 = (2401) 52 13 = (2402 . 8.1 2004 ) + (16 2004 . 4 Now (3 ) 111 + (4 ) 111 will be divisible by 3 + 4 3 = 81 + 64 = 145. Hence. is divided by 2402 is equal to -1 or 2402 . 2 . . We need to change it into the form a n + b n .

. What is the remainder when x 3 + 2x 2 + 5x + 3 is divided by x + 1? Answer: The remainder when the expression is divided by (x .3 2004 is divisible by 19 (Theorem 2).3 + 4 + c = 0.17 . 16! = (16! + 1) -1 = (16! + 1) + 16 .1.a EXAMPLES 10. find the value of c. 2 . 2.1E Fermat's Theorem EXAMPLE 12.1)(n + n 2 + 1) Now (n .n = n(n 6 .n is divisible by 6 x 7 = 42.1) = n (n + 1)(n . Remainder = (-1) 11.(-1)) will be f(-1).n is divisible by 7.1)(n)(n + 1) is divisible by 3! = 6 Hence n 7 .1F Wilson's Theorem EXAMPLE 13. n n 7 7 7 .1 2004 is divisible by 19 (Theorem 3) and 16 2004 . 2. Since the expression is divisible by x . 4 ..n is divided by 42? .1. If 2x 3 3 + 2(-1) 2 2 + 5(-1) + 3 = -1 -3x + 4x + c is divisible by x . or c = -3. is divided by x . Hence the remainder is 0.Now 20 2004 .1D When f(x) = a + bx + cx 2 + dx 3 +. What is the remainder when n Answer: Since 7 is prime. Hence the complete expression is divisible by 17 × 19 = 323. Find the remainder when 16! Is divided by 17. Hence the complete expression is also divisible by 19. Or 2 . the remainder f(1) should be equal to zero.

80 . How many numbers between 1 and 1200. Among these numbers divisible by 3 and 5. EXAMPLE 14. 16. How many numbers less than 400 are divisible by 12? Answer: Dividing 400 by 12. from set theory we have n(AUBUC) = n(A) + n(B) + n(C) . 3) Highest Commom Factor (HCF) and Least .187 = 213.n(10) + n(30) --> n(2U3U5) = 600 + 400 + 240 . we get the quotient as 33. and 5 = 1200 . Hence the remainder = the remainder obtained when 16 is divided by 17 = 16 Answer = 16 2. we get the quotient as 26. and that are divisible by a certain integer p. there are also numbers which are divisible both by 3 and 5 i. we get the quotients as 133 and 80 respectively.e.1G TO FIND THE NUMBER OF NUMBERS.120 + 40 = 880 Hence number of numbers not divisible by any of the numbers 2.n(B intersectn C) . Hence the number divisible by 3 or 5 = 133 + 80 . Dividing 400 by 3 and 5.Every term except 16 is divisible by 17 in the above expression. Hence the number of numbers that are below 400 and divisible by 12 is 33. 3 and 5? Answer: as in the previous example. both included.n(A intersectn C) + n(A intersectn B intersectn C) n(2U3U5) = n(2) + n(3) + n(5) . 3. How many numbers between 1 and 400. or 5. less than or equal to n.26 = 187 Hence.n(15) . we divide n by p. The quotient of the division gives us the number of numbers divisible by p and less than or equal to n. are not divisible by any of the numbers 2.n(6) .880 = 320. 3. 15. AND THAT ARE DIVISIBLE BY A CERTAIN INTEGER To find the number of numbers.200 . divisible by 3 x 5 = 15. we first find the number of numbers divisible by 2. We have counted these numbers twice.n(A intersectn B) . both included. Dividing 400 by 15. are not divisible either by 3 or 5? Answer: We first find the numbers that are divisible by 3 or 5. THAT ARE LESS THAN OR EQUAL TO A CERTAIN NATURAL NUMBER N. the numbers not divisible by 3 or 5 are = 400 .

. 25 December 2008. the first remainder by the second remainder.To find HCF of two numbers by division method. till the remainder is 0. Hence the HCF = 22 3 x 2 y = 12x 2y. . the factorization is called the prime factorization of that number. HCF = 23 3 2 = 72. The HCF is product of all such prime factors with their respective least indices. Hence. and 1080 Answer: 72 = 23 3 2. 288 = 25 3 2 . 3 and 1 respectively. 1080 = 23 3 3 5 The prime factors common to all the numbers are 2 and 3. 1. Division method. HIGHEST COMMON FACTOR (HCF) The largest number that divides two or more given numbers is called the highest common factor (HCF) of those numbers. 72 = 2 2 2 3 3 = 23 32 To find the HCF of given numbers by this method. and so on.Common Multiple (LCM) by Total Gadha Thursday. The lowest indices of 2 and 3 in the given numbers are 3 and 2 respectively. x and y in the numbers are 2. EXAMPLE Find the HCF of 288 and 1080 by the division method. we divide the higher number by the lower number. For every prime factor common to all the numbers.When a number is written as the product of prime numbers. Then we divide the lower number by the first remainder. EXAMPLE Find the HCF of 72. we choose the least index of that prime factor among the given number. The last divisor is the required HCF. 3. There are two methods to find HCF of the given numbers: Prime Factorization Method. 288.. Find the HCF of 36x 3y 2 and 24x 4y. For example. The least index of 2. 01:14 AM What is highest common factor (HCF) and least common multiple (LCM)? How do you calculate HCF and LCM of two or more numbers? Are you looking for problems on HCF and LCM? This chapter will answer all these questions. we perform the prime factorization of all the numbers and then check for the common prime factors. Answer: 36x 3y 2 = 2 2 3 2 x 3 y 2 24x 4y = 23 3 x 4 y.

156). the last divisor 72 is the HCF of 288 and 1080. How many pairs of such numbers are possible? Answer: If the HCF if 12. Answer: Since all the numbers give a remainder of 12 when divided by N. CONCEPT OF CO-PRIME NUMBERS: Two numbers are co-prime to each other if they have no common factor except 1. the number N = HCF = 2 4 3 = 48. 192. (60. The HCF of 120.12) are all divisible by N. 204) and (132. Hence. 8. the numbers can be written as 12x and 12y. The numbers 2604. (1020 .Answer: Hence. 1008 and 4800. 228).24). (536 . where x and y will be co-prime to each other. 12x + 12y = 288 x + y = 24. Answer: N will be the HCF of (400 . 192 and 144 is 24. Now 2592 = 2 5 3 4. give the remainders of 22.22). the numbers of groups formed for the three companies will be 5. N = 27. 8 and 27 are the pairs of co-prime numbers. the numbers left after dividing N 1 and N 2 by H are co-prime to each other. Hence. How many such numbers are . (5. only four pairs of such numbers are possible. (84. then. 19). For example.12). 276). Therefore. SOLVED PROBLEMS ON HCF Three company of soldiers containing 120. 536 and 645. 13). 23).12) and (4812 . N is the HCF of 2592. The HCF of two numbers is 12 and their sum is 288. The pair of numbers that are co-prime to each other and sum up to 24 are (1. 15 and 32. N will be the HCF of 378. when divided by a number N. Hence. the least number of total groups formed = 5 + 8 + 6 = 19. (7. Therefore. 23 and 24 respectively. Find the greatest such number N. where x and y are coprime to each other. 1020 and 4812 when divided by a number N give the same remainder of 12. The numbers 400. Hence. Find the highest such number N. The numbers are (12. What is the least number of total groups formed? Answer: The least number of groups will be formed when each group has number of soldiers equal to the HCF. 17) and (11. respectively. 513 and 621. 16 and 5. 1008 = 24 3 2 7 and 4800 = 26 3 5 2. and 144 soldiers are to be broken down into smaller groups such that each group contains soldiers from one company only and all the groups have equal number of soldiers. If the HCF of two numbers N 1 and N 2 be H. The HCF of two numbers is 12 and their product is 31104. if the HCF of two numbers be A. and 6. Therefore. Therefore. hence (2604 . the numbers can be written as Ax and Ay.23) and (645 .

216) and (8. 3. 196 and 240. To calculate the LCM of two or more numbers. Now we need to find co-prime pairs whose product is 216. 216 = 23 3 3 . breaking the numbers into product of prime numbers. respectively.M. 288 and 1080. we find the highest index. Therefore. 288 = 25 3 2 . among the given numbers. . Answer: 72 = 2 3 3 2. Hence. where x and y are co-prime to each other. The LCM is the product of all these prime numbers with their respective highest indices. we use the division method in the following way: L. 3 and 5 are 5. EXAMPLE Find the LCM of 72. we use the following two methods: Prime Factorization Method: After performing the prime factorization of the numbers. Division Method: To find the LCM of 72. only two such numbers are possible. the LCM = 2 3 3 2 x 4 y 2 = 72x 4y 2. 3 and 5. Therefore. the co-prime pairs will be (1. of all the prime numbers. Therefore. of the given numbers = product of divisors and the remaining numbers = 2 2 2 3 3 10 49 = 72 10 49 = 35280.C. i. Find the LCM of 36x 3y 2 and 24x 4y.possible? Answer: Let the numbers be 12x and 12y. 1080 = 2 3 3 3 5 The prime numbers present are 2. 3 and 1. The highest indices of 2. Hence the LCM = 2 5 3 3 5 = 4320. 2. Answer: 36x 3y 2 = 2 2 3 2 x 3 y 2 24x 4y = 23 3 x 4 y. 4 and 2 respectively. The highest indices (powers) of 2. 12x 12y = 31104 xy = 216. 27).e. LEAST COMMON MULTIPLE (LCM) The least common multiple (LCM) of two or more numbers is the lowest number which is divisible by all the given numbers. x and y are 3.

7. then P is the HCF of (N 1 .R 4) etc. 45 and 60. y If a number P always leaves a remainder R when divided by the numbers N 1. N 3 . Hence the highest four-digit number divisible by 24. 3. N 2.Hy = H(x . can be written as multiples of H (Hx. Then. Answer: The LCM of 2. is H. 7 and 8. N 1 + N 2 = Hx + Hy = H(x + y). give remainders R 1.N 2 = Hx . then N 1. N 4 etc. 36. 36. 168 + 5 = 173 will give a remainder of 5 when divided by these numbers. y If L is the LCM of N 1. ). the numbers (N 1 + N 2) and (N 1 . Hence.N 4). R 3. y The LCM of two or more numbers is greater than or equal to the largest of those numbers y If numbers N 1. N 3. respectively.N 2). is divisible by each of these numbers. Find the highest number less than 1800 that is divisible by each of the numbers 2.R 1).. N 2. 6 and 7. then.. 168 is divisible by 6. 36. 14 and 20 respectively? Answer: The common difference between the divisor and the remainder is 4 (9 5 = 4. Hy. What is the smallest number which when divided by 9. and every multiple of 420. N 3. 3. then P is a factor of (N 1 . N 3. and 8. 4. Hence both the sum and differences of the two numbers are divisible by the HCF.. N 2.R 2). 18 14 = . (N 4 . Answer: The LCM of 6. Let N 1 = Hx and N 2 = Hy. Hence. We can see that 1680 is the highest number less than 1800 which is multiple of 420. 6 and 7.N 2) are also divisible by H. the number 420. 24 leaves a remainder of 5. Hence. Therefore. SOLVED PROBLEMS ON LCM Find the highest four-digit number that is divisible by each of the numbers 24. the number (9999 â¼³ 279 = 3720) will be divisible by 360.PROPERTIES OF HCF AND LCM y The HCF of two or more numbers is smaller than or equal to the smallest of those numbers. 45 and 60 = 3720. N 3.y). then P = LCM (or a multiple of LCM) of N 1.N 3). 45 and 60 = 23 3 2 5 = 360. the highest number divisible by each one of 2. N 4.R 3). (N 3 . 840. all the multiples of L are divisible by these numbers.. 5. 4. 7 and 8 is 168. R 4.. give an equal remainder when divided by the same number P. N 2. and 1680 are all divisible by each of these numbers. N 4 etc.. Hence. y If numbers N 1. N 3. y If the HCF of numbers N 1. 5. The highest four-digit number is 9999. 5. 1260. (N 2 . Hence. the LCM of 24.. + R.. N 4. Hz. 6 and 7 is 420. N 4 etc. every number will be a multiple of the HCF. Since the HCF divides all the numbers. 45 = 3 2 5 and 60 = 2 3 3 2 5.. y If the HCF of two numbers N 1 and N 2 is H. and N 1 . N 2. Answer: 24 = 2 3 3. (N 3 . and less than 1800 is 1680. 18. 9999 when divided by 360 gives the remainder 279. N 2. Find the lowest number which gives a remainder of 5 when divided by any of the numbers 6. N 3 . R 2. 4. N 2. since the numbers will be multiples of H. 36 = 22 3 2. 3. (N 2 . Hence 420.. when divided by the same number P.

In fact. the number 2 and 7. the situation is similar to placing 4 similar balls in three similar boxes. The partition method wonâ¼t work. â¼ if it was something else and not something like this. Therefore.4. I shall cover some problems based on this in the CBT Club this week. Therefore. the resulting number will give remainders of 5. Letâ¼s find the number of ways of distributing these prime numbers. and 24 is 72.e. 4. 3. We can see that 182 is divisible by 7. Since the box are all same only the different grouping of number matters. Something like this: But you should quickly realize that in this way no matter where you place your partitions. we will first calculate for positive numbers and then assign signs to these numbers. Of course this happens because of the irritating habit that mathematicians have of asking. Therefore. Now the LCM of 9. 242 etc. Your first instinct is to write down 2. 122. 182. the lowest such number possible = 182. Since the problem asks for integers. 5 and 6 is 60. and 24. 18. 3 and 7. I shall have to end here and leave the rest of it for my CBT Club students. As we are talking about integers. 62. the number is of the form 60k + 2. the numbers of possible cases are: Â· All positive Â· One positive and two negative (we will have to find different ways of assigning positive and negative signs also in this case) . 14. Now 72 4 = 72 9 + 5 = 72 18 + 14 = 72 24 + 20. if we subtract 4 from 72. 4) It is funny how one problem gives rise to another. but leaves no remainder when divided by 7. 24 20 = 4). What is the lowest such number possible? Answer: the LCM of 3. 5. i. How would you do that? The hard way of course: So we have to place 4 prime numbers in 3 places. and 6 always leaves a remainder of 2. and 20 with 9. If a place remains empty after distribution that means we will assume number 1 over there. 4. The partitions will give you three groups of numbers. the number = 72 4 = 68. what would be the solution?â¼ And then you start all over again. 18. 5 and 7 in a row and place two partitions between them. 2 and 5 will never be together. A number when divided by 3. Here is a good problem I was discussing with a colleagueIn how many ways can you write the number 210 as a product of three integers? 210 = 2 Ã² 3 Ã² 5 Ã² 7. Hence.

All we have to do is to write the integer triplets (x.2. But do you stop at that? No.1. 1. positive. negative. 210) .g. total number of cases = 81. you ask another question: So how do we do it? The hard way again.There! 55 is the answer. (2.g. positive) Â· Case II (positive. Therefore. ( . Â· Case I (positive. Â· Case III (negative. z) of case I and then assign negative signs to y and z. y. . negative) e. positive) e.210) The number of cases will be equal to the number of cases when all of them are positive. positive. .

We have found answer to one more question.Â· Case IV (negative. There.. But what if it wasâ¼¦? The road is endless. negative. the number of ways = 54 Therefore. . Therefore. negative) The number of ways in this case will again be equal to the number of ways in case III as we can assign negative sign to y and z to all the cases of case III. the total number of ways = 81 + 81 + 54 + 54 = 270.

P510 Camera User Manual

ASP NET 4 and Visual Studio 2010 Web Development Overview

ASP NET 4 and Visual Studio 2010 Web Development Overview

Acads Related

VisualStudio2010_CertPath

Mobile Programming Platforms and ion

Testing

CVreader

Vedic Mathematics

- Read and print without ads
- Download to keep your version
- Edit, email or read offline

TG Time Speed Distance Guide

playing no.s

153 TG Math Problems E-book

Applications of Trignometry

g1

TG Number System

How to Find Last Two Digits

MBA CAT CAT 2011 CAT 2012 CAT Online MBA 2012 MBA Entrance Exams CAT Test Preparation CAT Questions

Divisors 2-Microsoft Word

23574292 Microsoft Word Venn Diagrams Basics Problems Maxima and Minima 4

tg1

Sentence Completion

Fiza Project

Total Gadha's CAT DI Challenge

pnc_tg

parajumbles tg

Quadratic Equation Compiled

Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

CANCEL

OK

You've been reading!

NO, THANKS

OK

scribd

/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->