I’m confused about how we can bring (n+1) inside the function in the attached solution without violating the function’s integrity. Why did we specifically choose n+1 instead of another value? How would we apply a numerical approach to this problem? I’ve tried to work it out, but I’m still struggling to understand it. I would appreciate any clarification on these different approaches. Thank you!
This one has been shown to be faulty and shouldn’t have been there. But we don’t have a #7 Hard?
Sorry, I don’t get what you are saying. What do you mean by this- “But we don’t have a #7 Hard?”
Where is this quiz from? Can you share a screenshot?
https://www.gregmat.com/course/timed-quant-practice
We don’t have a #7 Hard there.
Found it here - Timed Hard Quant Sections - Problems Bank - GregMat
@ganesh can you find an alternate question for this one?
@Archi this question is not suitable for the GRE, I wouldn’t worry about it!
I’ll swap it out for another one when I get a chance
Such a relief to hear this! 
Thank you—I panicked for a moment when I saw it.
1 Like
Haha no worries
We have changed the question for a different one, thanks