of all pairs of consecuitive integers whose sum is greater then 100 find the pair whose sum is the least.
![]() |
of all pairs of consecuitive integers whose sum is greater then 100 find the pair whose sum is the least.
As stated, this is an easy problem. Look for the smallest sum > 100. That would be 101, which 50+51 would give. Are you sure that one of the "sums" isn't "product"? That makes for a more interesting problem.
Wally H.
All times are GMT -7. The time now is 10:19 AM. |