To be divisible by 15, a number shall be divisible by both 3 and 5.
stmt(1)=> sum of all digits = 7+11 = 18 => it's divisible by 3 but not sure about 5. Hence stmt(1) alone is not suff
stmt(2)=> # must be 0 or 5 => the number 7*# is divisible by 5 and no hint about 3. Hence stmt(2) alone is not suff
If both statements are considered, the number must be 765 and is divisible by 15.
Answer "C"
DS
This topic has expert replies
Source: Beat The GMAT — Data Sufficiency |
-
mathbyvemuri
- Master | Next Rank: 500 Posts
- Posts: 142
- Joined: Thu Apr 26, 2012 3:24 am
- Location: India
- Thanked: 28 times
RaviSankar Vemuri
Join my Google Group on Math:
https://groups.google.com/group/mathbyvemuri
My Blog on Math:
https://mathbyvemuri.blocked/
Some concepts for GMAT:
https://mathbyvemuri.blogspot.in/2012/05 ... -data.html
https://mathbyvemuri.blogspot.in/2012/05 ... dates.html
https://mathbyvemuri.blogspot.in/2012/05 ... es-of.html
Join my Google Group on Math:
https://groups.google.com/group/mathbyvemuri
My Blog on Math:
https://mathbyvemuri.blocked/
Some concepts for GMAT:
https://mathbyvemuri.blogspot.in/2012/05 ... -data.html
https://mathbyvemuri.blogspot.in/2012/05 ... dates.html
https://mathbyvemuri.blogspot.in/2012/05 ... es-of.html

















