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.
Answer:
Solve for x by simplifying both sides of the equation, then isolating the variable.
x=−845
Step-by-step explanation:
Answer:
the answer is 29
Step-by-step explanation:
i don't really know how to explain it but hopefully it right
\left[x _{2}\right] = \left[ \frac{-1+i \,\sqrt{3}+2\,by+\left( -2\,i \right) \,\sqrt{3}\,by}{2^{\frac{2}{3}}\,\sqrt[3]{\left( 432\,by+\sqrt{\left( -6912+41472\,by+103680\,by^{2}+55296\,by^{3}\right) }\right) }}+\frac{\frac{ - \sqrt[3]{\left( 432\,by+\sqrt{\left( -6912+41472\,by+103680\,by^{2}+55296\,by^{3}\right) }\right) }}{24}+\left( \frac{-1}{24}\,i \right) \,\sqrt{3}\,\sqrt[3]{\left( 432\,by+\sqrt{\left( -6912+41472\,by+103680\,by^{2}+55296\,by^{3}\right) }\right) }}{\sqrt[3]{2}}\right][x2]=⎣⎢⎢⎢⎢⎡2323√(432by+√(−6912+41472by+103680by2+55296by3))−1+i√3+2by+(−2i)√3by+3√224−3√(432by+√(−6912+41472by+103680by2+55296by3))+(24−1i)√33√(432by+√(−6912+41472by+103680by2+55296by3))⎦⎥⎥⎥⎥⎤
totally answer.
Answer:
you can't do that since its a whole number
