- Joined
- Mar 22, 2006
- Messages
- 387
- Reaction score
- 0
If N is any positive integer, how many consecutive integers following N are needed to insure that at least one of the integers is divisible by another positive integer m?
A. m-1
B. m
C. m+1
D. 2m
E. m^2
Stella has 3 quarters and 4 dimes. How many different amounts can she form with these 7 coins, using at least one coin each time?
A. 8
B. 19
C. 20
D. 21
E. 25
A. m-1
B. m
C. m+1
D. 2m
E. m^2
Stella has 3 quarters and 4 dimes. How many different amounts can she form with these 7 coins, using at least one coin each time?
A. 8
B. 19
C. 20
D. 21
E. 25