Number System - Page 702 - PaGaLGuY - Com - Remainders

5/4/2011 Number System - Page 702 - PaGaLGu…
Home Forums B-school Rankings MBA Abroad Work at PaGaLGuYNew Online Store More >> Not logged in Help
Register Community Calendar Today's Posts Search
» Sponsors » Sponsors
PaGaLGuY.com - The Everything of MBA in India and Abroad, C AT 2011, GMAT,
XAT, MAT > Exam Resources > Quantitative Questions and Answers User Name User Name
Number System
Password Log in
Register to Start Posting Now
Forgot your password?
Quantitative Questions and Answers Discuss Quantitative and other Math related questions. Post your math doubts and
get it solved by the smartest brains this side of the universe !
Notices
Welcome to the PaGaLGuY.com MBA forums. Register here, It's free and anyone can join!
In case of any problems, contact us at info@pagalguy.com
A d v e rt i se He re A d v e rt i se He re
PaGaLGuY Dream Team | UnderDogs Team | PaGaL-Gal Dream Team | Shout Boxers Team
Regional Dream Teams 2010
Ahmedabad | Bangalore | Chennai | Delhi-NCR | Hyderabad | Kolkata | Lucknow | Mumbai | Pune
Tags: number, system
» Thread Closed Page 702 of 1004 « First < 202 602 652 692 700 701 702 703 704 712 752 802 > Last »
LinkBack Thread Tools Display Modes
A d v e rt i se He re
(#7011)
Re: Number System - 04-09-2008, 12:28 PM

rahulshaitan
Waiting for my joining.....
Hardcore PaGaL Quote:
Originally Posted by nidhisoni24

m sure my answers r correct thts y i said his ans is wrong...answere for last digit
qs ia 29...
Posts: 391
Join Date: Jun 2007 i have posted my approach and answ er is coming 89.
Age: 23 if my approach is wrong please correct my approach
Thanks: 77
Thanked 149 Times in 69
Posts Last edited by rahulshaitan; 04-09-2008 at 01:06 PM.
Groans: 4
Groaned at 7 Times in 6 Posts
A d v e rt i se He re
Sponsored Links
(#7012)

MaskedMenace
A d v e rt i se He re FMS ding! 98.8%ile in cat with
72%ile in quant :( Quote:
C ertified PaGaL
PG MADCAPZ Originally Posted by poojadatta
@ masked menace I made two minor mistake in that I have corrected it. Let me
know which part you did not understood.
r[2222^(6k+5)/7]=3
pagalguy.com/…/852-number-system-7… 1/7
r[5555^(2k+2)]/7]=4
if this was the reason of doubt then I think it should be as I made mistake in this it
should be
r[2222^(6k+5)/7]=5
r[5555^(2k+2)]/7]=2
Posts: 2,750
Join Date: Aug 2008 ya..got it now...
Location: Bangalore
Age: 24
Thanks: 1,036
Thanked 1,457 Times in 813
Posts
Groans: 7
Groaned at 11 Times in 11
Posts
(#7013)

riya0910
has no status.
Newbie PaGaL Can Anyone please help me in getting the solution to:
Remainder w hen 2^1990 is divided by 1990
Posts: 21
Join Date: Mar 2008
Thanks: 0
Thanked 0 Times in 0 Posts
Groans: 0
(#7014)

MaskedMenace
FMS ding! 98.8%ile in cat with
72%ile in quant :( Quote:
C ertified PaGaL
PG MADCAPZ Originally Posted by riya0910
Can Anyone please help me in getting the solution to:
Remainder when 2^1990 is divided by 1990
shivam had done it..chk previous threads..
Posts: 2,750
Join Date: Aug 2008
Location: Bangalore
Age: 24
Thanks: 1,036
Thanked 1,457 Times in 813
Posts
Groans: 7
Groaned at 11 Times in 11
Posts
(#7015)

nidhisoni24
sleeping :mg:
Expert PaGaL Quote:
Originally Posted by rahulshaitan

i have posted my approach and answer is coming 8.
if my approach is wrong please correct my approach
hey rahul yes ur right...i didi calculation mistake...m sorry for tht
Posts: 158
Join Date: May 2007
Thanks: 180
Posts
Groans: 2
Groaned at 1 Time in 1 Post
(#7016)

rahulshaitan
Originally Posted by riya0910

Can Anyone please help me in getting the solution to:
Remainder when 2^1990 is divided by 1990
Posts: 391 in denominator we have 1990

Join Date: Jun 2007 now braek this into two coprime nos.
Age: 23 1990=10 x 199
Thanks: 77
Thanked 149 Times in 69 now find the rem. individually for these two coprime nos seperately
Posts
Groans: 4 rem[2^1990/10]
Groaned at 7 Times in 6 Posts which is equal to the last digit = 4
therefore the number is of the form 10a + 4
now find rem[2^1990/199]
=rem[2^10/199]
=29
therefore the number is of the form 199b = 29
now equate the two equations obtained

10a+4=199b+29
solve this this equation is satisfied for b=5

therefore the remainder is 1024
hope it's clear now
Last edited by rahulshaitan; 04-09-2008 at 01:21 PM.
(#7017)

rahulshaitan
Originally Posted by nidhisoni24

hey rahul yes ur right...i didi calculation mistake...m sorry for tht
it's alryt
Posts: 391 no problem
Join Date: Jun 2007
Age: 23
Thanks: 77
Posts
Groans: 4
(#7018)

rahulshaitan
Hardcore PaGaL hello everyone i found this theory on net and its really helpful for those who find
difficulty in finding remainders so i m posting this here
REMAINDERS
Suppose the numbers N 1 , N 2 , N 3 … give quotients Q 1 , Q 2 , Q 3 … and

remainders R 1 , R 2 , R 3 ..., respectively, when divided by a common divisor D.
Therefore N 1 = D × Q 1 + R 1 ,
N2 =D× Q 2 +R2 ,
Posts: 391 N 3 = D × Q 3 + R 3 .. and so on.
Join Date: Jun 2007
Let P be the product of N 1 , N 2 , N 3 …
Age: 23
Thanks: 77
Therefore, P = N 1 N 2 N 3 ..
Thanked 149 Times in 69 = (D × Q 1 + R 1 )(D × Q 2 + R 2 )(D × Q 3 + R 3 )..
Posts = D × K + R 1 R 2 R 3 ... w here K is some number ---- (1)
Groans: 4 In the above equation, only the product R 1 R 2 R 3 … is free of D, therefore the
Groaned at 7 Times in 6 Posts remainder w hen P is divided by D is the remainder when the product R 1 R 2 R 3 … is
divided by D.
Let S be the sum of N 1 , N 2 , N 3 …
Therefore, S = (N 1 ) + (N 2 ) + (N 3 ) +...
= (D × Q 1 + R 1 ) + (D × Q 2 + R 2 ) + (D × Q 3 + R 3 )..
= D × K + R 1 + R 2 + R 3 … where K is some number--- (2)
Hence the remainder when S is divided by D is the remainder when R 1 + R 2 + R 3 is
divided by D.
Examples:
1. What is the remainder when the product 1998 × 1999 × 2000 is divided by
7?
Answer: the remainders w hen 1998, 1999, and 2000 are divided by 7 are 3, 4, and 5
respectively. Hence the final remainder is the remainder when the product 3 × 4 × 5
= 60 is divided by 7.
Answer = 4
1. What is the remainder when 2 2004 is divided by 7?
2 2004 is again a product (2 × 2 × 2... (2004 times)). Since 2 is a number less than 7
we try to convert the product into product of numbers higher than 7. Notice that 8 =
2 × 2 × 2. Therefore we convert the product in the following manner-
2 2004 = 8 668 = 8 × 8 × 8... (668 times).
The remainder when 8 is divided by 7 is 1.
Hence the remainder when 8 668 is divided by 7 is the remainder obtained when the
product 1 × 1 × 1... is divided by 7
Answer = 1
This problem is like the previous one, except that 2006 is not an exact multiple of 3
so w e cannot convert it completely into the form 8 x . We will write it in follow ing
manner-
2 2006 = 8 668 × 4.
Now, 8 668 gives the remainder 1 when divided by 7 as we have seen in the
previous problem. And 4 gives a remainder of 4 only when divided by 7. Hence the
remainder w hen 2 2006 is divided by 7 is the remainder when the product 1 × 4 is
divided by 7.
Answer = 4
Again 25 25 = (18 + 7) 25 = (18 + 7)(18 + 7)...25 times = 18K + 7 25

Hence remainder when 25 25 is divided by 9 is the remainder when 7 25 is divided by
9.
Now 7 25 = 7 3 × 7 3 × 7 3 .. (8 times) × 7 = 343 × 343 × 343... (8 times) × 7.
The remainder when 343 is divided by 9 is 1 and the remainder when 7 is divided by
9 is 7.
Hence the remainder when 7 25 is divided by 9 is the remainder we obtain when the
product 1 × 1 × 1... (8 times) × 7 is divided by 9. The remainder is 7 in this case.
Hence the remainder when 25 25 is divided by 9 is 7.
Some Special Cases:
2.1A When both the dividend and the divisor have a factor in common.
Let N be a number and Q and R be the quotient and the remainder when N is divided
by the divisor D.
Hence, N = Q × D + R.
Let N = k × A and D = k × B where k is the HCF of N and D and k > 1.
Hence kA = Q × kB + R.
Let Q 1 and R 1 be the quotient and the remainder when A is divided by B.
Hence A = B × Q 1 + R 1 .
Putting the value of A in the previous equation and comparing we get-
k(B × Q 1 + R 1 ) = Q × kB + R --> R = kR 1 .
Hence to find the remainder when both the dividend and the divisor have a factor in
common,
1. Take out the c ommon factor (i.e. divide the numbers by the common
factor)
Divide the resulting dividend (A) by resulting divisor (B) and find the
remainder (R 1 ).
The real remainder R is this remainder R1 multiplied by the common
factor (k).
Examples
1. What the remainder when 2 96 is divided by 96?
The common factor betw een 2 96 and 96 is 32 = 2 5 .

Removing 32 from the dividend and the divisor we get the numbers 2 91 and 3
respectively.
The remainder when 2 91 is divided by 3 is 2.
Hence the real remainder will be 2 multiplied by common factor 32.
Answer = 64
2.1B THE CONCEPT OF NEGATIVE REMAINDER
15 = 16 × 0 + 15 or
15 = 16 × 1 – 1.
The remainder when 15 is divided by 16 is 15 the first case and −1 in the second
case.
Hence, the remainder when 15 is divided by 16 is 15 or −1.
--> When a number N < D gives a remainder R (= N) when divided by D, it gives a
negative remainder of R − D.
For example, when a number gives a remainder of −2 with 23, it means that the
number gives a remainder of 23 – 2 = 21 with 23.
EXAMPLE
1. Find the remainder when 7 52 is divided by 2402.
Answer: 7 52 = (7 4 ) 13 = (2401) 13 = (2402 – 1) 13 = 2402K + (−1) 13 = 2402K −1.

Hence, the remainder when 7 52 is divided by 2402 is equal to −1 or 2402 – 1 =
2401.
Answer: 2401.
2 .1C When dividend is of the form a n + b n or a n – b n :
EXAMPLES
1. What is the remainder when 3 444 + 4 333 is divided by 5?
Answer:
The dividend is in the form a x + b y . We need to change it into the form a n + b n .
3 444 + 4 333 = (3 4 ) 111 + (4 3 ) 111 .
Now (3 4 ) 111 + (4 3 ) 111 will be divisible by 3 4 + 4 3 = 81 + 64 = 145.
Since the number is divisible by 145 it will certainly be divisible by 5.
Hence, the remainder is 0.
1. What is the remainder when (5555) 2222 + (2222) 5555 is divided by 7?
Answer:
The remainders when 5555 and 2222 are divided by 7 are 4 and 3 respectively.
Hence, the problem reduces to finding the remainder w hen (4) 2222 + (3) 5555 is
divided by 7.
Now (4) 2222 + (3) 5555 = (4 2 ) 1111 + (3 5 ) 1111 = (16) 1111 + (243) 1111 .
Now (16) 1111 + (243) 1111 is divisible by 16 + 243 or it is divisible by 259, which is
a multiple of 7.
Hence the remainder when (5555) 2222 + (2222) 5555 is divided by 7 is zero.
1. 20 2004 + 16 2004 – 3 2004 − 1 is divisible by:
(a) 317 (b) 323 (c) 253 (d) 91

Solution: 20 2004 + 16 2004 – 3 2004 – 1 = (20 2004 – 3 2004 ) + (16 2004 – 1 2004
).
Now 20 2004 – 3 2004 is divisible by 17 (Theorem 3) and 16 2004 – 1 2004 is
divisible by 17 (Theorem 2).
Hence the complete expression is divisible by 17.
20 2004 + 16 2004 – 3 2004 – 1 = (20 2004 – 1 2004 ) + (16 2004 – 3 2004 ).
Now 20 2004 – 1 2004 is divisible by 19 (Theorem 3) and 16 2004 – 3 2004 is
divisible by 19 (Theorem 2).
Hence the complete expression is also divisible by 19.
Hence the complete expression is divisible by 17 × 19 = 323.
2.1D When f(x) = a + bx + cx 2 + dx 3 +... is divided by x – a
EXAMPLES
1. 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 − (−1)) will be f(−1).
Remainder = (−1) 3 + 2(−1) 2 + 5(−1) + 3 = −1
1. If 2x 3 −3x 2 + 4x + c is divisible by x – 1, find the value of c.
Since the expression is divisible by x – 1, the remainder f(1) should be equal to zero.
Or 2 – 3 + 4 + c = 0, or c = −3.
2 .1E Fermat’s Theorem
EXAMPLE
1. What is the remainder when n 7 – n is divided by 42?
Answer: Since 7 is prime, n 7 – n is divisible by 7.

n 7 – n = n(n 6 – 1) = n (n + 1)(n – 1)(n 4 + n 2 + 1)
Now (n – 1)(n)(n + 1) is divisible by 3! = 6
Hence n 7 – n is divisible by 6 x 7 = 42.
Hence the remainder is 0.
2.1F Wilson ’s Theorem
EXAMPLE
1. Find the remainder when 16! Is divided by 17.
16! = (16! + 1) -1 = (16! + 1) + 16 – 17

Every term except 16 is divisible by 17 in the above expression. Hence the remainder
= the remainder obtained when 16 is divided by 17 = 16
Answer = 16
2.1G TO FIND THE NUMBER OF NUMBERS, THAT ARE LESS THAN OR EQUAL TO A
CERTAIN NATURAL NUMBER N, AND THAT ARE DIVISIBLE BY A CERTAIN
INTEGER
To find the number of numbers, less than or equal to n, and that are divisible by a
certain integer p, w e 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.
EXAMPLE
19. How many numbers less than 400 are divisible by 12?
Answer: Dividing 400 by 12, we get the quotient as 33. Hence the number of
numbers that are below 400 and divisible by 12 is 33.
20. How many numbers between 1 and 400, both included, are not divisible either by
3 or 5?
Answer: We first find the numbers that are divisible by 3 or 5. Dividing 400 by 3 and
5, w e get the quotients as 133 and 80 respectively. Among these numbers divisible
by 3 and 5, there are also numbers which are divisible both by 3 and 5 i.e. divisible by
3 x 5 = 15. W e have counted these numbers twice. Dividing 400 by 15, w e get the
quotient as 26.
Hence the number divisible by 3 or 5 = 133 + 80 – 26 = 187
Hence, the numbers not divisible by 3 or 5 are = 400 – 187 = 213.
21. How many numbers between 1 and 1200, both included, are not divisible by any
of the numbers 2, 3 and 5?
Answer: as in the previous example, we first find the number of numbers divisible by
2, 3, or 5. from set theory we have
n(AUBUC) = n(A) + n(B) + n(C) – n(A ∩ B) – n(B ∩ C) – n(A ∩ C) + n(A ∩ B ∩ C)
n(2U3U5) = n(2) + n(3) + n(5) – n(6) – n(15) – n(10) + n(30)
à n(2U3U5) = 600 + 400 + 240 – 200 – 80 – 120 + 40 = 880
Hence number of numbers not divisible by any of the numbers 2, 3, and 5
= 1200 – 880 = 320.
Last edited by rahulshaitan; 04-09-2008 at 04:58 PM.
The Following 6 Users Say Thank You to rahulshaitan For This Useful Post:
anand_953 (04-09-2008), Go_GettIt (04-09-2008), MaskedMenace (04-09-2008), parag01 (04-09-2008), prade (04-09-2008),
SHIKHA mehta (26-12-2008)
(#7019)
Re: Number System - 05-09-2008, 10:25 AM

guerrero
look what the cat dragged in
Trainee PaGaL Puys! I again 've a doubt here...
33^34^35 mod7 gives ans:4
but how is it 2?? (posted in somewhere back).
some cyclicity been used..can some body make it clear.
Posts: 95 also, 55^52^50 mod 7 ans 1??
Join Date: Jan 2008
Thanks: 48 thnks!
Thanked 23 Times in 17 Posts
Groans: 3
(#7020)
Re: Number System - 05-09-2008, 11:01 AM

rahulshaitan
Originally Posted by guerrero

Puys! I again 've a doubt here...
33^34^35 mod7 gives ans:4
but how is it 2?? (posted in somewhere back).
some cyclicity been used..can some body make it clear.
Posts: 391 also, 55^52^50 mod 7 ans 1??
Join Date: Jun 2007
Age: 23
Thanks: 77 thnks!
Posts
Groans: 4 applying fermat's little formula
anything raised to power N-1 when divided by N gives a remainder1 when N is prime
so
(any number)^6 mod 7 w ill give remainder 1

apply this to the above problems you will get the respective answers as 2 and 1
respectively
if you find difficulty then let me know i will post the solution
Page 702 of 1004 « First < 202 602 652 692 700 701 702 703 704 712 752 802 > Last »
» Thread Closed
« C AT 2008: QQAD Practice Test Discussions | SolidGyan DI - Set a Day Discussions »
Posting Rules
You may not post new threads

You may not post replies
You may not post attachments
You may not edit your posts
BB code is On
Smilies are On
[IMG] code is On
HTML code is Off
Trackbacks are On
Pingbacks are On
Refbacks are Off
Forum Jump
Forum Rules Quantitative Questions and Answers 6 Go
PaGaLGuY.com is not responsible for the views and opinions of the posters.
PaGaLGuY.com is an Inzane Labs Private Limited production.
Advertise - Contact Us - PaGaLGuY.com - Top

Number System - Page 702 - PaGaLGuY - Com - Remainders

Diunggah oleh

Informasi Dokumen

Deskripsi Asli:

Judul Asli

Hak Cipta

Format Tersedia

Bagikan dokumen Ini

Bagikan atau Tanam Dokumen

Opsi Berbagi

Apakah menurut Anda dokumen ini bermanfaat?

Apakah konten ini tidak pantas?

Hak Cipta:

Format Tersedia

Number System - Page 702 - PaGaLGuY - Com - Remainders

Diunggah oleh

Hak Cipta:

Format Tersedia

5/4/2011 Number System - Page 702 - PaGaLGu…

Register Community Calendar Today's Posts Search

Regional Dream Teams 2010

Ahmedabad | Bangalore | Chennai | Delhi-NCR | Hyderabad | Kolkata | Lucknow | Mumbai | Pune

Tags: number, system

LinkBack Thread Tools Display Modes

Re: Number System - 04-09-2008, 12:28 PM

Originally Posted by nidhisoni24

Re: Number System - 04-09-2008, 12:34 PM

Re: Number System - 04-09-2008, 12:36 PM

Re: Number System - 04-09-2008, 12:43 PM

shivam had done it..chk previous threads..

Re: Number System - 04-09-2008, 12:51 PM

Originally Posted by rahulshaitan

Re: Number System - 04-09-2008, 01:15 PM

Originally Posted by riya0910

Posts: 391 in denominator we have 1990

now equate the two equations obtained

solve this this equation is satisfied for b=5

hope it's clear now

Last edited by rahulshaitan; 04-09-2008 at 01:21 PM.

Re: Number System - 04-09-2008, 01:24 PM

Originally Posted by nidhisoni24

Re: Number System - 04-09-2008, 01:29 PM

Suppose the numbers N 1 , N 2 , N 3 … give quotients Q 1 , Q 2 , Q 3 … and

1. What is the remainder when 2 2004 is divided by 7?

1. What is the remainder when 2 2006 is divided by 7?

1. What is the remainder when 25 25 is divided by 9?

Again 25 25 = (18 + 7) 25 = (18 + 7)(18 + 7)...25 times = 18K + 7 25

1. What the remainder when 2 96 is divided by 96?

The common factor betw een 2 96 and 96 is 32 = 2 5 .

1. Find the remainder when 7 52 is divided by 2402.

Answer: 7 52 = (7 4 ) 13 = (2401) 13 = (2402 – 1) 13 = 2402K + (−1) 13 = 2402K −1.

1. What is the remainder when 3 444 + 4 333 is divided by 5?

1. What is the remainder when (5555) 2222 + (2222) 5555 is divided by 7?

1. 20 2004 + 16 2004 – 3 2004 − 1 is divisible by:

(a) 317 (b) 323 (c) 253 (d) 91

1. What is the remainder when x 3 + 2x 2 + 5x + 3 is divided by x + 1?

1. If 2x 3 −3x 2 + 4x + c is divisible by x – 1, find the value of c.

1. What is the remainder when n 7 – n is divided by 42?

Answer: Since 7 is prime, n 7 – n is divisible by 7.

1. Find the remainder when 16! Is divided by 17.

16! = (16! + 1) -1 = (16! + 1) + 16 – 17

Last edited by rahulshaitan; 04-09-2008 at 04:58 PM.

Re: Number System - 05-09-2008, 10:25 AM

Re: Number System - 05-09-2008, 11:01 AM

Originally Posted by guerrero

(any number)^6 mod 7 w ill give remainder 1

« C AT 2008: QQAD Practice Test Discussions | SolidGyan DI - Set a Day Discussions »

You may not post new threads

Advertise - Contact Us - PaGaLGuY.com - Top

Anda mungkin juga menyukai