Answer:
There are 28 fruits in each pile.
Step-by-step explanation:
We are given the following in the question:
Let x denote the number of fruits in each pile and y denote the number of fruits that every traveler receive.
Consider the diophantine equation:
We obtain the greatest common divisor of (63,-23).
The greatest common divisor f 63 and -23 is 1.
Therefore, there exist such that
By applying extended Euclidean Algorithm, we have,
Multiplying -7 on both sides, we get,
Thus, we get,
Thus, there are 28 fruits in each pile.