# GMAT Problem of the Week. Issue#36

There are four different digits a < b < c < d. M and N are the least and the greatest positive four-digit integers that can be written using each of these digits exactly password once. If M + N = 10,477, what is the value of b?

(A) 2
(B) 3
(C) 4
(D) 5
(E) 6

# GMAT Problem of the Week. Issue#35

<img 70-446 class=”aligncenter size-thumbnail wp-image-698″ src=”http://blog.mbastrategy.ua/wp-content/uploads/2013/09/numbers1-150×150.jpg” alt=”" width=”150″ height=”150″ />

If n is a positive integer, and its greatest divisor different from n 70-447 itself equals to 91, casinos how many possible values are there for n?

(A) 3

(B) 4

(C) 37

(D) 90

(E) Infinitely many

# GMAT Problem of the Week. Issue#29

If r and s are positive integers, and the ratio r/s is expressed as a decimal, is r/s a terminating decimal? (Any decimal that has only a finite Within this expansive software library, you can find some wonderful casino applications, roulette included. number of non-zero digits is a terminating decimal.)
(1) 50 < r < 60
(2) s = 6

A. Statement (1) ALONE is sufficient, but statement (2) alone is not sufficient.

B. Statement (2) ALONE is sufficient, but statement (1) alone is not sufficient.

C. BOTH statements TOGETHER are sufficient, but NEITHER statement ALONE is sufficient.

D. EACH statement ALONE is sufficient.

E. Statements (1) and (2) TOGETHER are NOT sufficient.

# GMAT Problem of the Week. Issue#25

There are three non-transparent candy machines with equal number of candies. The first one contains chocolate candies, the second – mints, and the third – chocolate and mints together. Three labels, “Chocolate”, “Mint” and “Both”, are assigned to the three machines, but none of Aber keine Sorge, denn der online www.facebook.com/BookofRaSpielautomat Slot Gladiators ist nicht ganz so lebensgefahrlich wie die thematische Vorlage. the labels is placed correctly. What is the minimum number of candies one should buy to define which machine contains which candies.074-344

(A) 1

(B) 2

(C) 5

(D) The number of candies in one candy machine plus one

(E) The number of candies in one candy machineplus two

# GMAT Problem of the Week. Issue#23

Bob drove from town X to town Y at a constant speed, and then drove back to X along the same route at a different constant speed. Did Bob travel from X to Y at a speed greater than doudounecanadaparis 50 km per hour?

(1) Bob’s average speed for the entire round trip, canada goose pas cher excluding the time spent at town Y, was 100 km per hour.

(2) It took Bob 15 more minutes to drive from X to Y than to make the return trip.

 (A) Statement (1) ALONE is sufficient, but statement (2) alone is not sufficient. (B) Statement (2) ALONE is sufficient, but statement (1) alone is not sufficient. (C) Both statements TOGETHER are sufficient, but NEITHER one ALONE is sufficient. (D) EACH statement ALONE is sufficient. (E) Statements (1) and (2) TOGETHER are NOT sufficient.