When 20 is divided by the positive integer k, the remainder is k &ndas...
Try dividing 20 by all the options, get remainders or K-2 for all the options and find suitable value for k by subtracting 2 from the K or divisor every time.
When 20 is divided by the positive integer k, the remainder is k &ndas...
To find the value of k, we can use the concept of the remainder theorem. According to the theorem, when a positive integer a is divided by a positive integer b, the remainder is always less than b.
In this case, we are given that when 20 is divided by k, the remainder is k. However, the remainder k cannot be greater than k itself. Therefore, we can conclude that k must be less than or equal to 20.
To determine the exact value of k, we need to find a positive integer that satisfies the given condition. Let's consider some possibilities:
If k = 1, then the remainder when 20 is divided by 1 is 0, not k. So, k = 1 is not the correct value.
If k = 2, then the remainder when 20 is divided by 2 is 0, not k. So, k = 2 is not the correct value.
If k = 3, then the remainder when 20 is divided by 3 is 2, which is equal to k. Therefore, k = 3 is the correct value.
Hence, when 20 is divided by the positive integer k, the remainder is k if k = 3.
To make sure you are not studying endlessly, EduRev has designed GMAT study material, with Structured Courses, Videos, & Test Series. Plus get personalized analysis, doubt solving and improvement plans to achieve a great score in GMAT.