gmatophobia
PS Question 1 - Apr 11 How many positive integers less than 10,000 are such that the product of their digits is 30? A. 12 B. 24 C. 36 D. 38 E. 50 Source:
GMAT Club Tests | Difficulty: Hard
Ways to create 30:
30*1
15*2
6*5
2*3*5
Now, there is no overlap between the ways to create 30 - so this makes the question easier.
Also note it is the product of their digits - so there cannot be a 0, otherwise it is 0. This excludes 30*1 from the list.
The above also tells us that the numbers may not have any 0s in between them. So something like 1520 is not possible.
that leaves:
ways to arrange 2,3,5=3!=6
ways to arrange 6*5=2!=2
ways to arrange 1,5,2=3!=6
Also consider adding a few 1s:
ways to arrange 1,1,5,2=4!/2!=24/2=12
ways to arrange 1,6,5=3!=6
ways to arrange 1,2,3,5=4!=24
and also
1,1,6,5=4!/2!-12.
For a sum of: 6+2+6+12+6+24+12=68
the logic is correct but I am doing something wrong

gmatophobia
PS Question 1 - Apr 08 Positive integer z leaves the remainder of 1 when divided by 3, the remainder of 3 when divided by 5 and the remainder of 5 when divided by 7. What is the smallest possible value of z? A. 101 B. 103 C. 105 D. 107 E. 208 Source:
GMAT Club Tests | Difficulty: Medium
Easy way to do this:
Eliminate A since it would give remainder 2 when divided by 3 rather than remainder 1.
Eliminate C since that divides evenly into 5.
Eliminate D for the same reasons as A - R2 when divided by 3 rather than R1.
That leaves B and E.
E divided by 5 gives a remainder of 3 when divided by 5, and when divided by 7 it is 5. E matches all the rules.
B: 103/7 gives remainder 5, and 103/5 gives remainder 3.
Since we are looking for the smallest value and both B and E work, it must be B.