Divisibility of Integers

Hard Data Sufficiency Determining Sufficiency

Let x and y be positive integers. We want to determine if x is divisible by y.

Statement (1): The greatest common divisor (GCD) of x and y is equal to y.

Statement (2): The least common multiple (LCM) of x and y is equal to x.

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

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

Both statements together are sufficient, but each statement alone is not sufficient.

Each statement alone is sufficient.

Submitted3.0K

Correct2.8K

% Correct94%