Problem 51
From a given a list of 1000 integers from 1 to 1000 , extract pairs of numbers whose product is 2424 .
Problem 53
The following program segment is designed to compute the product of two nonnegative integers \(X\) and \(Y\) by accumulating the sum of \(X\) copies of \(Y\); that is, 3 times 4 is computed by accumulating the sum of three \(4 \mathrm{~s}\). Is the program segment correct? Explain your answer. Product \(=0\) Count \(=0\) repeat: Product \(=\) Product \(+Y\) Count \(=\) Count \(+1\) until (Count \(==X\) )
