GREQuantum

Yes, the answer is indeed D.

Yes, garbage question with poor language, please stay away from unofficial GRE questions. Here is one from the GRE test writers on slicing pies. One-kth of a circular pie has been served. If the rest of the pie is divided into n equal servings, then each of these servings is what fraction of the whole pie? A) 1/(nk) B) (k-n)/(nk) C) 1/(n-k) D) (k-1)/(nk) E) (k-1)/n Cheers, Dabral

The best content for GRE is provided by ETS, the folks who write the test. As long as you stick to these you will have a good sense of the style and difficulty level of the test. The problem with test prep outfits is that the quality of the questions is often poor and often they don't represent the questions tested on the real GRE test. A lot of my students who have used unofficial sources often will tell me that the real exam was very different from the content in the books written by majority of the test prep outfits. Use the following resources: 1) Official Guide to GRE 2nd Edition The Official Guide to the GRE Revised General Test, 2nd Edition: Educational Testing Service: 9780071791236: Amazon.com: Books 2) At the end of this month they will be coming up with two guides, one for Verbal and one for Quantitative reasoning. Official GRE Quantitative Reasoning Practice Questions: Educational Testing Service: 9780071834322: Amazon.com: Books 3) Free PowerPrep II software from ETS. GRE Revised General Test: POWERPREP II Software 4) Free GRE Paper test: Only attempt this after taking the PowerPrep II tests because there is overlap and will bias your PowerPrep scores. http://www.ets.org/s/gre/pdf/practice_book_GRE_pb_revised_general_test.pdf If you stick to these, you will be ahead of the majority of test takers. Cheers, Dabral

In general three lines in a plabe can divide a space in to a maximum number of seven regions and just imagine placing the rectangle so that it falls on all of these seven regions. The answer is indeed 7.

@ashraf you made a simple arithmetic mistake. your formulation is correct but the two quantities add up to 30 instead of 19. @mani raja this is a combination problem, where order of selection of the musicians/poets does not matter.

Here is a video explanation to this diagonal problem:

The key phrase here is the "least number of consecutive days" which means you have to look at the best case scenario where she can write as many pages in the time frame as possible. The best case would be start on a Saturday(as you suggested) which would require 73 days and is the Quantity A in this problem. However, if Quantity A was: The number of consecutive days it takes Susan to write the novel. In that case the answer would be D. Dabral

I will rephrase the question: If b, c, and d, are consecutive even integers, such that 2 A) 8 B) 16 C) 24 D) 48 E) 192 The answer is 48. The reason is that b, c, and d are all even, which means each one is divisible by 2, so we know for sure that the product bcd is a multiple of at least 8. Now every other even integer is a multiple of 4, which means that at the very least one of the numbers b, c, or d, must be divisible by 4, that means bcd must be a multiple of 16. It can be a multiple of 64 as in the example of 4, 6, and 8, however we are looking for the largest number that must always be a divisor. For example, if b=18, c = 20, and d = 22, then bcd is only divisible by 16. Now where does the 3 come from. In a set of three consecutive even integers, at least one number must be a multiple of 3, therefore the product bcd must always be divisible by 16*3=48. Dabral

The problem says that SSM unit is always in the center it cannot be moved around, its position is fixed. This means that words such as GSSMOAERE are not acceptable. Essentially, you are arranging 6 objects centered around another object. This would be similar to the question about how many ways one can seat 5 people in a row that includes Mary, where Mary always sits in the middle, the answer is 4!.

If the five numbers are a, b, 16, c, d, we are given that (a+d)/2 = 15 or a+d =30. Further, after we remove the smallest and the largest integer(a and b), the average of the smallest and largest integers(now b and c) is 14, or (b+c)/2 = 14 or b+c = 28. To summarize, this is what we have so far: Five numbers: a, b, 16, c, d a + d = 30 b + c = 28 Now, or goal is to come up with the least possible value for d, so we need to maximize the other numbers. Here both a and b have to be less than 16, because 16 is the median. What if we make a to be 14 and b to be 15, this would give us d = 16 and c=13, but that wouldn't work. So if we instead make c to be 16, then b=12, and then the least largest possible value of a is 12, which would make d to be 18. So our final sequence is: 12, 12, 16, 16, 18 This is one way to do it, I am sure there are other approaches as well. Perhaps using inequalities, but not sure if it would be faster. Dabral

it is indeed zero

valkener, of all the official gre questions that i have seen so far i have never seen a single question that required the direct use of the quadratic equation. in general, the quadratics on the gre can be easily factored. the type of harder quadratics you will encounter on the exam would be along the lines of 5x^2 + 3x - 2 =0, as long as you can solve these easily by factoring you don't really need to know the quadratic formula. now, i do want to point out that in the official gre guide, ets does provide the quadratic formula, so you never know if they would toss a question that uses that concept. if you are scoring fairly high in your practice test then i would say definitely memorize the formula with a solid understanding, otherwise just stick with the factoring approach. dabral

greinsanity, your method is the best way to do this problem. i don't know if you looked at the video explanation in the link i provided, but it essentially talks about first establishing a pattern and this requires one to compute the first few terms(here 8 terms) and then to find out the number of repeating blocks to finally answer the question. please recognize that this would be a level 5 question(hardest according to ETS) in the exam and someone who scores a 170 will likely spend about three minutes on this question. these are a general type of sequence problems with a repeating pattern. in the exam the test writers will present this same problem with different flavors but the basic approach is the same. dabral

gekkojr, looks like my post disappeared. i wrote a similar sequence problem, these types of sequences have a repeating pattern, and the key is to identify the pattern. here is the image of the problem statement. [ATTACH=CONFIG]6615[/ATTACH] solve it and then you can watch the video on youtube for the explanation: cheers, dabral

gekkojr, I went ahead and wrote a similar sequence question along the lines of your post. This will keep me out of trouble from ETS. This is an example of a repeating sequence that has a specific pattern. I have attached the image of the problem I wrote. http://www.www.urch.com/forums/attachments/gre-math/6614-need-help-these-2-math-problems-grequestion17.png Here is the link to the video explanation I posted on youtube: Cheers, dabral