On each day of their tour of the West Indies, Sourav and Srinath have either an apple or an orange for breakfast. Sourav has oranges for the first m days, apples for the next m days, followed by oranges for the next m days, and so on. Srinath has oranges for the first n days, apples for the next n days, followed by oranges for the next n days, and so on.
If gcd(m,n)=1, and if the tour lasted for mn days, on how many days did they eat the same kind of fruit? number theorygreatest common divisorinductionalgorithmcombinatorics proposedcombinatorics