The integers m and p are such that 2<m<p, and m is not a factor of p. If r is the remainder when p is divided by m, is r>1?
(1) The greatest common factor of m and p is 2.
(2) The least common multiple of m and p is 30.
What's the best way to determine which statement is sufficient? Can any experts assist?
The integers m and p are such that 2<m<p, and m is not
This topic has expert replies
-
- Moderator
- Posts: 426
- Joined: Tue Aug 22, 2017 8:48 pm
- Followed by:1 members
- elias.latour.apex
- Master | Next Rank: 500 Posts
- Posts: 228
- Joined: Thu Apr 20, 2017 1:02 am
- Location: Global
- Thanked: 32 times
- Followed by:3 members
- GMAT Score:770
I think you meant to ask:
The integers m and p are such that 2 is less than m and m is less than p. Also, m is not a factor of p.
If r is the remainder when p is divided by m, is r > 1?
1. The greatest common factor of m and p is 2.
2. The least common multiple of m and p is 30.
The integers m and p are such that 2 is less than m and m is less than p. Also, m is not a factor of p.
If r is the remainder when p is divided by m, is r > 1?
1. The greatest common factor of m and p is 2.
2. The least common multiple of m and p is 30.
Elias Latour
Verbal Specialist @ ApexGMAT
blog.apexgmat.com
+1 (646) 736-7622
Verbal Specialist @ ApexGMAT
blog.apexgmat.com
+1 (646) 736-7622