All Exams Test series for 1 year @ ₹349 only
Question

If 7 divided a positive integer n, the remainder is 2. Which of the following numbers gives a remainder of 0 when divided by 7?

This question was previously asked in
SSC CGL 2019 (Tier 2) GS Finance & Economics Previous Year Paper (17-Nov-2020)
The correct answer is

n + 5

Understanding the Remainder Condition for Integer n

The problem states that when a positive integer n is divided by 7, the remainder is 2. This mathematical relationship can be expressed in two primary ways:

  • Using the division algorithm: n can be written as $n = 7q + 2$, where $q$ is the quotient, and is an integer ($q \ge 0$ since $n$ is positive).
  • Using modular arithmetic: n is congruent to 2 modulo 7, written as $n \equiv 2 \pmod{7}$. This means n belongs to the set $\{2, 9, 16, 23, ...\}$.

Our goal is to find which of the given expressions, when divided by 7, yields a remainder of 0. This means we are looking for an expression that is a multiple of 7.

Analyzing Options for Divisibility by 7

Let's examine each option by substituting $n = 7q + 2$ or using the congruence $n \equiv 2 \pmod{7}$:

  1. Option 1: n + 1
    • Using substitution: $(7q + 2) + 1 = 7q + 3$. When $7q + 3$ is divided by 7, the quotient is $q$ and the remainder is 3.
    • Using modular arithmetic: $n + 1 \equiv 2 + 1 \pmod{7} \equiv 3 \pmod{7}$. The remainder is 3.
  2. Option 2: n + 2
    • Using substitution: $(7q + 2) + 2 = 7q + 4$. When $7q + 4$ is divided by 7, the quotient is $q$ and the remainder is 4.
    • Using modular arithmetic: $n + 2 \equiv 2 + 2 \pmod{7} \equiv 4 \pmod{7}$. The remainder is 4.
  3. Option 3: n - 5
    • Using substitution: $(7q + 2) - 5 = 7q - 3$. To find the standard remainder (which must be non-negative and less than 7), we can rewrite this as $7q - 3 = 7(q - 1) + 7 - 3 = 7(q - 1) + 4$. When $n - 5$ is divided by 7, the remainder is 4.
    • Using modular arithmetic: $n - 5 \equiv 2 - 5 \pmod{7} \equiv -3 \pmod{7}$. Since $-3$ is congruent to $4 \pmod{7}$ (because $-3 + 7 = 4$), the remainder is 4.
  4. Option 4: n + 5
    • Using substitution: $(7q + 2) + 5 = 7q + 7$. We can factor out 7: $7q + 7 = 7(q + 1)$. This expression is exactly divisible by 7, meaning the remainder is 0.
    • Using modular arithmetic: $n + 5 \equiv 2 + 5 \pmod{7} \equiv 7 \pmod{7} \equiv 0 \pmod{7}$. The remainder is 0.

Conclusion on Remainder 0

Based on the analysis of each option, the expression n + 5 is the only one that results in a remainder of 0 when divided by 7. This is because adding 5 to a number that leaves a remainder of 2 when divided by 7 completes the next multiple of 7.

Was this answer helpful?

Similar Questions

  1. What is the quotient when 1359 is divided by 48?

  2. What is the value of x so that the seven digit number 5656x52 is divisible by 72?

  3. What is the value of x so that the seven digit number 55350x2 is divisible by 72?

  4. The greatest number that divides 126, 224 and 608 leaving remainders 2, 7 and 19, respectively, is:

  5. What least number must be subtracted from 210, so that the sum is completely divisible by 11?

  6. A number when divided by the sum of 555 and 445 gives two times their difference as quotient and 30 as the remainder. The number is:

  7. In a division sum, the divisor ‘d’ is 10 times the quotient ‘q’ and 5 times the remainder ‘r’. If r = 46, the dividend will be:

  8. If the 8-digit number 2074x4y2 is divisible by 88, then the value of (4x + 3y) is:

  9. The greatest number which may replace * in the number 1190*6 make the number divisible by 9 is

  10. If the nine-digit number 708x6y8z9 is divisible by 99 then what is the value of x + y + z?


Important Questions from Divisibility and Remainder

  1. Which of the following numbers divides 6,30,605?
  2. What smallest number should be added to 57846 so that the sum is completely divisible by 58?
  3. What smallest number should be added to 16809 so that the sum is completely divisible by 41?

  4. What smallest number should be added to 91673 so that the sum is completely divisible by 88?
  5. When a number divided by 8379 gives the remainder 87. What will be the remainder when the same number divided by 63?
Need Expert Advice?
Upcoming Exams
SSC CPO
November 23, 2026
SSC CHSL
November 30, 2026
SSC JE
November 30, 2026
Test Series
SSC CGL img
SSC
SSC CGL (Tier I + Tier II) 2026 Mock Test Series - Latest Pattern
2509 Tests 6 Tests Free
9141 Attempts
4.2(952)
English, Hindi
More Questions from SSC CGL

Start Your Preparation with Prepp Mobile App

Download the app from Google Play & App Store
Download the app from Google Play & App Store
Prepp Mobile App