• Home
  • News
  • Forums
    • CAT & related B-schools
    • XAT, SNAP, IIFT, MAT, CMAT   and related B-schools
    • CAT: Quant Prep
    • CAT: Verbal Prep
    • CAT: GK & other resources
    • GMAT & GRE prep
    • GMAT accepting B-schools
    • Jobs & Careers
    • Pre-MBA Jobs
    • Post-MBA Jobs
    • Chit-Chat
    • PG-Meets & Events
    • Life @ B-schools
    • Touching Lives
  • Apps
    • Townhall
    • Badges
    • Birthdays
  • Rankings
 

Messages

Send a New Message
View All

Notifications

View All

Karma Updates

View All
    Live Ticker
    Login
    • Forgot password?

    New to PaGaLGuY?

    Login ×

    New to PaGaLGuY? Sign Up!

    Login

    Login
    Forgot your password/username?

    Forgot your password? ×

    Advertisements
    Advertisements
    CAT 2012 Quant: Basic applications of the Remainder Theorem
    by Ravi Handa in CAT, Quantitative Aptitude, Remainders, CAT 2012 on 26 April '12


    The division of Berlin during the Cold War had left no remainders.



    In my previous post, we discussed the cyclical nature of the remainders when an is divided by d. In this post, we will see how problems on finding out the remainder can be broken down into smaller parts.



    Funda 1: Remainder of a sum when it is being divided is going to be the same as the sum of the individual remainders.


    ? Rem = Rem + Rem + Rem ...


    Let us look at an example for this case.


    Find out the remainder when (79+80+81) is divided by 7.


    If we add them up, we get the sum as 240 and the remainder is 2. However, it would be easier to find out the individual remainders of 79, 80 & 81; which come out to be 2, 3 & 4 respectively and adding them up later to get the answer. This process is shown below,


    Rem (79+80+81) = Rem (2+3+4)/7 = Rem (9/7) = 2


    I hope you would agree that the second method is easier. But the difference in difficulty level is not that well highlighted here. Let us look at another idea on the same lines.



    Funda 2: Remainder of a product when it is being divided is going to be the same as the product of the individual remainders.


    ? Rem = Rem * Rem * Rem ...


    Let us look at an example for this case,


    Find out the remainder when (79 x 80 x 81) is divided by 7.


    If we multiply it first, we get the product as 511,920 and the remainder as 3. However, it would be easier to find out the individual remainders of 79, 80 & 81; which come out to be 2, 3 & 4 respectively and then multiply them to get 24, which will eventually lead to the remainder of 3.


    Rem (79 * 80 * 81) = Rem (2 * 3 * 4)/7 = Rem (24/7) = 3


    I guess there is no doubt now that the second method is easier. To be honest, I would take more time to just find out the product of (79 x 80 x 81) than to solve the entire question. That is the reason I recommend breaking down the problem into smaller parts.



    Funda 3: Negative Remainders When the absolute value of the negative remainder is less than the absolute value of the positive remainder, it is recommended that you consider a multiple greater than the divisor.


    When 7 is divided by 4, the remainder can be considered as 3 or -1.


    When 18 is divided by 7, the remainder can be considered as 4 or -3.


    When 689 is divided b 23, the remainder can be considered as 22 or -1.


    As you can see from above, the calculations would reduce drastically in the third case if you considered a negative remainder. As a tip, in remainder questions, you should always think of multiples or powers which can lead to a remainder of 1 or -1. Till now, the examples I have taken are too simple to be asked in the Common Admission Test (CAT) or for that matter any other MBA entrance exam. Let us look at an example that uses all the above-mentioned ideas and is of a slightly higher difficulty level.


    Find out the remainder when 83261 is divided by 17.


    First of all we need to break down 83261into smaller parts.


    Rem (83261/17) = Rem


    We know that Rem (83/17) = 15 or -2.


    It would be easier if consider the remainder as -2 because our calculations would be easier. So our question reduces to,


    Rem = Rem = -Rem


    Now, referring to the tip I gave above, think of a power of 2 that would give a remainder of 1 or -1 from 17. 24 is 16 and would give a remainder of -1 from 17. We have a 2261 here. We will have to break it down to (2260 x 2) so that we can convert it to a power of 16. This step is shown below,

    -Rem = -Rem = -Rem

    -Rem = -Rem = 2

    I highly recommend that in this question and other questions of this type, you should verify the answer from Wolfram Alpha. Hope you found this article useful. I look forward to your suggestions for future posts.



    Author Ravi Handa has taught Quantitative Aptitude at IMS for 4 years. An alumnus of IIT Kharagpur where he studied a dual-degree in computer science, he has also written a book on business awareness.

    • Reply
    • Like 110
    • Share 1
    • Follow
    shikhaswaroop, avinash.murala & 108 others like this
    shared this
    • Page 3 of 4  
    • LOKESH3 Very valuable fundamentals... Thanks for sharing
      #41 • 02 May '12 Like
    • Commu Method 1: 83^261/17 Step 1: 83/17 Remainder=15 Hence now the question reduces to 15^261/17 Now 15 and 17 are co prime numbers hence : Euler =16 15^16/17=Remainder=15^5/17=Remainder =2 Method 2:(Much Simpler) ((15)^260 X 15^1)/17 As 15^2 =4 AS REMAINDER and hence (4^2)^65 THEREAFTER will give 16 AS Remainder Then 16*15 =240 /17 = 2 Remainder Sourav Chakrabarti Ex Ims Guest Faculty Pune TAPMI PGDM 2011-2013
      #42 • 02 May '12 Like
    • Commu An interesting question 2^133/133
      #43 • 02 May '12 Like
    • rasesh try this handakafunda.com
      #44 • 02 May '12 Like
    • rbidanta Hi Ravi, Indeed a good trick. I was trying to find out 67^99/7 Cyclicity comes to be: 3 with 4,2,1 as possible remainder and rem(n/r)=0 how to go about it. but if I go with negative remainder which is -3 and cyclicity= 6 with values 3,2,6,4,5,1 and rem(n/r)=3 that means -6 now does it holds true that if -remainder is -6 then positive remainder=7-6=1 Please clarify
      #45 • 03 May '12 Like
    • abhibansal123 @techsurge bhai negative remainder wala last case samaj nai aaya..can you explain please?
      #46 • 12 Aug '12 Like
    • techsurge @abhibansal123

      negative remianders are much easier to work with for example

      if i say find remainder when (24222421)^n / 2422

      you can write as (2422k -1)^n /2422

      now if you open the binomial expansion very term will be divisble by 2422 exxcept nCn (-1)^n ... Now if n is even remainder will be simple 1

      if n is odd , remainder is -1, which means it is actually divisor -1
      #47 • 12 Aug '12 Like
    • abhibansal123 @techsurge yeah that is clear..but in the above article Remainder when 83261/17..how has he taken 83/17 directly?
      #48 • 12 Aug '12 Like
    • techsurge @abhibansal123 832671 can be written as 152671 as both yield same remainder... reason 832761=17k +

      he is breaking number into smaller parts

      like 95/13 yields same remainder as 30/13 . I subtracted a multiple of 13 from numerator i.e 65

      in this case thenumber is too big... so he is making it short by removing 680000 from numerator as the remaining numerator will yield same numerator
      #49 • 12 Aug '12 Like 1
    • rahulkgupta What will be the answer for 148 ^ 1084 last 2 digits??
      #50 • 18 Aug '12 Like
    • jaldeep14 sir, the photo in the starting of the post is wonderful....
      #51 • 29 Aug '12 Like
    • ravihanda You can download all my articles in proper formatting in a PDF from this link http://bit.ly/ArticlesEbook
      #52 • 14 Sep '12 Like
    • rmknt plz help
      when 50! is divided by 16^15 what will be the reminder ?
      #53 • 06 Oct '12 Like
    • techsurge @rmknt
      give options.....I could solve till step below
      16^15= 2^60
      number of 2's in 50!=47
      so remainder will be definitely a multiple of 2^47 ????
      #54 • 06 Oct '12 Like
    • rmknt @techsurge thnx for ur reply the option are
      1
      0
      2
      4
      #55 • 06 Oct '12 Like
    • rmknt @techsurge look I also solved this much and I'm stuck after it ..
      actually there will be 48 2's in 50! .'. 2^48 will be completely divided and we will left with only odd no. and on denominator there will be 2^12 only now what to do ?? :(
      #56 • 06 Oct '12 Like
    • techsurge @rmknt no idea better post in Quant thread........ someone might solve
      #57 • 06 Oct '12 Like
    • rmknt ok
      #58 • 06 Oct '12 Like
    • Mr.WisePants @rahulkgupta 76..
      #59 • 23 Nov '12 Like
    • shivani_shrihar very good article. But please also give solution to :
      -> to find the last digit of of 7 to the power 325
      -> to count the number of zeros in 4 to the power 2000
      -> to find the last non zero digit of 4 to the power 2000
      #60 • 02 Mar Like
    • Page 4 of 4  
    • kiru03haran pls anyone explain funda 3........
      #61 • 14 Mar Like
    • rmaheshwari33 @rmknt : please tell me how u calculate number of 2 in 50! ...nd if u get the solution of this question please post it here ..thanx in adv :)
      #62 • 29 Mar Like
    • Mahateb I am not sure if this is right thread to ask this question. Can anyone please explain concept of MOD or PHI that is used to solve many type of problems in number system. I have seen people lot of tough question on finding remainder using it.

      #63 • 02 Apr Like
    • B I U
      Press Shift+Enter to add a new line.

    • © 2013 PaGaLGuY
    • About Us
    • Careers
    • Advertise
    • Contact Us
    • Help
    • Privacy
    Report This Content ×

    Your report does not guarantee removal of this content from the site. It will be removed altogether only if a Moderator finds it especially useless after reviewing it.

    Warn User

    ×

    Repeal a Warning

    ×

    Promote this post

    ×
    web02:8017