Guest Posted April 1, 2010 Report Share Posted April 1, 2010 (edited) 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 100. Edited April 1, 2010 by K Sengupta Quote Link to comment Share on other sites More sharing options...
0 Guest Posted April 1, 2010 Report Share Posted April 1, 2010 (edited) 2352 ways. I hope i didnt miss anything or double count anything Edited April 1, 2010 by DeeGee Quote Link to comment Share on other sites More sharing options...
0 Guest Posted April 1, 2010 Report Share Posted April 1, 2010 I got a different answer than DeeGee I got 1358. Sub findabcd() num = 1 For a = 1 To 20 For b = a To 20 For c = b To 20 For d = c To 20 prod = a * b * c * d If (prod Mod 100 = 0) Then Cells(num + 1, 1) = num Cells(num + 1, 2) = a Cells(num + 1, 3) = b Cells(num + 1, 4) = c Cells(num + 1, 5) = d Cells(num + 1, 6) = prod num = num + 1 End If Next Next Next Next End Sub Quote Link to comment Share on other sites More sharing options...
0 superprismatic Posted April 1, 2010 Report Share Posted April 1, 2010 (edited) I agree with BebopKid. Edited April 1, 2010 by superprismatic Quote Link to comment Share on other sites More sharing options...
Question
Guest
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 100.
Edited by K SenguptaLink to comment
Share on other sites
3 answers to this question
Recommended Posts
Join the conversation
You can post now and register later. If you have an account, sign in now to post with your account.