All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Just Math
Counting Quadruplets (Posted on 2010-08-20) Difficulty: 3 of 5
Each of A, B, C and D is a positive integer with the proviso that A ≤ B ≤ C ≤ D ≤ 20.

Determine the total number of quadruplets (A, B, C, D) such that A*B*C*D is divisible by 50.

No Solution Yet Submitted by K Sengupta    
Rating: 4.0000 (1 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Agreed | Comment 4 of 11 |

I agree with Charlie's answer = 1570.  I did essentially the same four loops, but instead of dividing by 50 (or using mod) I just tested that the last two digits of the six-digit product field were either "00" or "50" -- probably did not save even a microsecond.  The loop constraints handle the concern that the "less than or equal" could create any quadruplet twice (and hence the concern for doublecounting).  Obviously the same products appear many times, but their uniqueness is not at issue (as I interpret this).


  Posted by ed bottemiller on 2010-08-20 16:44:15
Please log in:
Remember me:
Sign up! | Forgot password

Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (0)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Copyright © 2002 - 2021 by Animus Pactum Consulting. All rights reserved. Privacy Information