Each of the \(20\) machines are paired up with another machine only once, and the pair works for \(1\) day, until all unique pairs are exhausted.
Lets say the \(20\) machines are named \(a, b, c, d.........t \) and their rate of work is also denoted by the same alphabet.
Pairs including machine \(a\) would be \((a,b), (a,c), (a,d).............(a,t)\). Machine \(a\) will make \(19\) pairs (because there are \(20\) machines and \((a,a)\) is not a valid pair).
The same would be true for all other machines. They will make \(19\) pairs with every remaining machine.
The work done by pair \((a,b)\) in \(1\) day will be \(a+b\)
The work done by pair \((a,c)\) in \(1\) day will be \(a+c\)
Similarly, each pair will complete a fraction of work until all pairs are exhausted. If we add all the work done by pairs, we should get - >
\((a+b)+(a+c)...........(t+r)+(t+s)= 19(a+b+c.......t)\) (We can factor out a \(19\) because each machine's rate of work shows up \(19\) times in this)
Let \(a+b+c.......t = R\)
The total work done by all the pairs \(= 19(R)\)
The remaining work was done by all \(20\) machines in \(6\) days.
So the rate of work of all machines when working together is \(= a+b+c.......t \)
In \(6\) days, they completed \(6(a+b+c.......t) = 6(R)\) units of work.
The total work done can be assumed to be 1 unit, which is the sum of the work done by the pairs and the work done by all the machines working together for \(6\) days.
\(19(R) + 6(R) = 1\)
\(25(R) = 1\)
\(R = \frac{1}{25}\)
So, all machines working together can complete \(1\) unit of work in \(25\) days.