Post your question in the Comment section below, and a GRE expert will answer it as fast as humanly possible.

- Video Course
- Video Course Overview
- General GRE Info and Strategies - 7 videos (free)
- Quantitative Comparison - 7 videos (free)
- Arithmetic - 42 videos
- Powers and Roots - 43 videos
- Algebra and Equation Solving - 78 videos
- Word Problems - 54 videos
- Geometry - 48 videos
- Integer Properties - 34 videos
- Statistics - 28 videos
- Counting - 27 videos
- Probability - 25 videos
- Data Interpretation - 24 videos
- Analytical Writing - 9 videos (free)
- Sentence Equivalence - 39 videos (free)
- Text Completion - 51 videos
- Reading Comprehension - 16 videos

- Study Guide
- Philosophy
- Office Hours
- Extras
- Prices

## Comment on

Consecutive Integers p, q, r and s## Hi Brent,

Your videos are highly insightful. Please, why did you not represent p,q, r and s with consecutive integers, eg, 1,2,3,4 respectively,& simplify. I did that and I got 1 also. It seems faster.

## If we choose only one set of

If we choose only one set of values (e.g., 1, 2, 3, and 4 to represent p, q, r and s) then we risk the possibility not handling every possible case.

For example, IF the expression for Quantity A were something like (p+1)(q+2)(r+1)(s+2), then just plugging in 1, 2, 3, and 4 to represent p, q, r and s would suggest that Quantity B is greater. However, if we ALSO let 2, 3, 4 and t represent p, q, r and s, then we'd see that the correct answer is actually D.

Now, for the original question, it happens to be the case that plugging in ANY 4 consecutive numbers will always yield the correct answer of C. So, your approach works. However, if you take a more general approach, then you can add more certainty to your response.

## Will odd number divided by 2

## Yes, that's correct.

Yes, that's correct.

## In one of the videos, you

## That's correct!

That's correct!

If k is an integer, we know that 2k must be divisible by 2.

So, when we divide 2k by 2, the remainder is 0.

Since 2k+1 is ONE GREATER THAN 2k, we know that we'll get a remainder of 1 when we divide 2k+1 (aka an odd number) by 2.

PS: Thanks for the kind words about the course!