find tree consecutive positive integers such that the product of the first and the third integer is 15
![]() |
find tree consecutive positive integers such that the product of the first and the third integer is 15
Three consecutive integers.
If the first integer is X, the second must be X+1, and the third must be X+2. Right?
"Product" means multiplication.
All times are GMT -7. The time now is 02:53 PM. |