There are 'n' students in a grade 6 of a school. Each student is given unique roll number from 1 to 'n'. On a particular day, each student was present except Jessica. The sum of roll numbers of students present is 458. The roll number of Jessica is
A) 7
B) 8
C) 9
D) 10
E) None of the above
OA will be given later.
Roll Number of Jessica
This topic has expert replies
GMAT/MBA Expert
- [email protected]
- Elite Legendary Member
- Posts: 10392
- Joined: Sun Jun 23, 2013 6:38 pm
- Location: Palo Alto, CA
- Thanked: 2867 times
- Followed by:511 members
- GMAT Score:800
Hi pannalal,
Since we're dealing with a sum from 1 to N, we can use 'bunching' to save some time. To start, we need to have a sum that's relatively close to 458 and we can do a couple of 'brute force' calculations to hone in on what N could be:
IF... N = 20
the numbers 1 to 20 can be 'bunched' into 10 groups of 21...
(10)(21) = 210. That's not close enough to 458 though, so we need N to be HIGHER...
IF... N = 30
the numbers 1 to 30 can be 'bunched' into 15 groups of 31...
(15)(31) = 465. That's fairly close to 458, so 30 is almost certainly the total number of students.
465 - 458 = 7, and that result 'fits' the restrictions of the prompt, so Jessica's assigned number must be 7.
Final Answer: A
GMAT assassins aren't born, they're made,
Rich
Since we're dealing with a sum from 1 to N, we can use 'bunching' to save some time. To start, we need to have a sum that's relatively close to 458 and we can do a couple of 'brute force' calculations to hone in on what N could be:
IF... N = 20
the numbers 1 to 20 can be 'bunched' into 10 groups of 21...
(10)(21) = 210. That's not close enough to 458 though, so we need N to be HIGHER...
IF... N = 30
the numbers 1 to 30 can be 'bunched' into 15 groups of 31...
(15)(31) = 465. That's fairly close to 458, so 30 is almost certainly the total number of students.
465 - 458 = 7, and that result 'fits' the restrictions of the prompt, so Jessica's assigned number must be 7.
Final Answer: A
GMAT assassins aren't born, they're made,
Rich
-
- GMAT Instructor
- Posts: 2630
- Joined: Wed Sep 12, 2012 3:32 pm
- Location: East Bay all the way
- Thanked: 625 times
- Followed by:119 members
- GMAT Score:780
Here's another approach that doesn't involve guesstimation:
The sum from 1 to n = n * (n + 1) / 2, so n * (n + 1)/2 - j = 458.
Since n * (n + 1)/2 > 458, n ≥ 30. But n ≥ j, and if n > 30, then n * (n + 1)/2 - n > 458, meaning there is no solution j. So 30 ≥ n.
Since n ≥ 30 and 30 ≥ n, n must be 30, and j must be 7.
The sum from 1 to n = n * (n + 1) / 2, so n * (n + 1)/2 - j = 458.
Since n * (n + 1)/2 > 458, n ≥ 30. But n ≥ j, and if n > 30, then n * (n + 1)/2 - n > 458, meaning there is no solution j. So 30 ≥ n.
Since n ≥ 30 and 30 ≥ n, n must be 30, and j must be 7.