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

 Counting Quadruplets III (Posted on 2011-02-06)
Determine the total number of quadruplets (A,B, C, D) of positive integers with A ≤ B ≤ C ≤ D ≤ 25, such that (A+B)*(C+D) is divisible by |A*D – B*C|, whenever A*D ≠ B*C.

Note: |x| refers to the absolute value of x.

 No Solution Yet Submitted by K Sengupta No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
 re(2): computer solution ... Do me a favor , Charlie | Comment 3 of 6 |
(In reply to re: computer solution ... Do me a favor , Charlie by Ady TZIDON)

DEFDBL A-Z
FOR a = 1 TO 25
FOR b = a TO 25
FOR c = b TO 25
FOR d = c TO 25
ctAll = ctAll + 1
num = (a + b) * (c + d)
den = ABS(a * d - b * c)
IF a * d = b * c THEN
PRINT TAB(40); a; b; c; d
ct0 = ct0 + 1
ELSE
IF num MOD den = 0 THEN
PRINT a; b; c; d
ct = ct + 1
END IF
END IF
NEXT
NEXT
NEXT
NEXT
PRINT ctAll, ct, ct0

finds

20475 for the overall count.

 Posted by Charlie on 2011-02-07 12:20:15

 Search: Search body:
Forums (0)