With $1000 a rancher is to buy steers at $25 each and cows at $26 each. If the number of steers s and the number of cows c are both positive integers, then:
<spanclass=′latex−bold′>(A)</span> this problem has no solution<spanclass=′latex−bold′>(B)</span> there are two solutions with s exceeding c<spanclass=′latex−bold′>(C)</span> there are two solutions with c exceeding s<spanclass=′latex−bold′>(D)</span> there is one solution with s exceeding c<spanclass=′latex−bold′>(E)</span> there is one solution with c exceeding s modular arithmeticleast common multiplenumber theoryDiophantine equation