challenge problem Archives | Page 7 of 10

Challenge Problem Showdown – August 6, 2012

by Tom Williams Aug 6, 2012

challenge problem

We invite you to test your GMAT knowledge for a chance to win! Each week, we will post a new Challenge Problem for you to attempt. If you submit the correct answer, you will be entered into that week’s drawing for a free Manhattan GMAT Prep item. Tell your friends to get out their scrap paper and start solving!

Here is this week’s problem:

Jean puts N identical cubes, the sides of which are 1 inch long, inside a rectangular box, each side of which is longer than 1 inch, such that the box is completely filled with no gaps and no cubes left over. What is N?

(1) 56 < N < 63 (2) N is a multiple of 3.

Challenge Problem Showdown – July 30th, 2012

by Tom Williams Aug 6, 2012

challenge problem

Here is this week’s problem:

In the country of Celebria, the Q-score of a politician is computed from the following formula:
Q = 41ab²c³/d², in which the variables a, b, c, and d represent various perceived attributes of the politician, all of which are measured with positive numbers. Mayor Flower’s Q-score is 150% higher than that of Councilor Plant; moreover, the values of a, b, and c are 60% higher, 40% higher, and 20% lower, respectively, for Mayor Flower than for Councilor Plant. By approximately what percent higher or lower than the value of d for Councilor Plant is the corresponding value for Mayor Flower?

Challenge Problem Showdown – July 23rd, 2012

by Tom Williams Jul 30, 2012

challenge problem

Here is this week’s problem:

X is a three-digit positive integer in which each digit is either 1 or 2. Y has the same digits as X, but in reverse order. What is the remainder when X is divided by 3?

(1) The hundreds digit of XY is 6.
(2) The tens digit of XY is 4.

Challenge Problem Showdown – July 16th, 2012

by Tom Williams Jul 24, 2012

challenge problem

Here is this week’s problem:

A decade is defined as a complete set of consecutive nonnegative integers that have identical digits in identical places, except for their units digits, with the first decade consisting of the smallest integers that meet the criteria, the second decade consisting of the next smallest integers, etc. A decade in which the prime numbers contain the same set of units digits as do the prime numbers in the second decade is the

Challenge Problem Showdown – July 9th, 2012

by Tom Williams Jul 16, 2012

challenge problem

Here is this week’s problem:

If a, b, and c are nonzero integers and z = b^c, is a^z negative?

(1) abc is an odd positive number.
(2) | b + c | < | b | + | c |

Challenge Problem Showdown – July 2nd, 2012

by Tom Williams Jul 9, 2012

A_x(y) is an operation that adds 1 to y and then multiplies the result by x. If x = 2/3, then A_x(A_x(A_x(A_x(A_x(x))))) is between

Challenge Problem Showdown – June 25th, 2012

by Tom Williams Jul 2, 2012

Here is this week’s problem:

In the x-y coordinate plane, what is the minimum distance between a point on line L and a point on line M?

Challenge Problem Showdown – June 18th, 2012

by Tom Williams Jun 25, 2012

Here is this week’s problem:

The 4 sticks in a complete bag of Pick-Up Sticks are all straight-line segments of negligible width, but each has a different length: 1 inch, 2 inches, 3 inches, and 4 inches, respectively. If Tommy picks a stick from each of 3 different complete bags of Pick-Up Sticks, what is the probability that Tommy CANNOT form a triangle from the 3 sticks?

Challenge Problem Showdown – June 11th, 2012

by Tom Williams Jun 18, 2012

Here is this week’s problem:

Z is the set of the first n positive odd numbers, where n is a positive integer. Given that n> k, where k is also a positive integer, x is the maximum value of the sum of k distinct members of Z, and y is the minimum value of the sum of k distinct members of Z, what isx + y?

Challenge Problem Showdown – June 4th, 2012

by Tom Williams Jun 11, 2012

For any numbers a and b, min(a, b) and max(a, b) represent the minimum and the maximum of a and b, respectively. If c > a, is a < b < c?

(1) min(max(a, b), c) = max(min(b, c), a)

(2) max(max(a, b), c) “ min(min(b, c), a) > c “ a

breadcrumbs

Articles tagged "challenge problem"

Challenge Problem Showdown – August 6, 2012

Challenge Problem Showdown – July 30th, 2012

Challenge Problem Showdown – July 23rd, 2012

Challenge Problem Showdown – July 16th, 2012

Challenge Problem Showdown – July 9th, 2012

Challenge Problem Showdown – July 2nd, 2012

Challenge Problem Showdown – June 25th, 2012

Challenge Problem Showdown – June 18th, 2012

Challenge Problem Showdown – June 11th, 2012

Challenge Problem Showdown – June 4th, 2012