There are several letters e, a and b on a blackboard. We may replace two e's by one e, two a's by one b, two b's by one a, an a and a b by one e, an a and an e by one a,ab, and an e by one b. Prove that the last letter does not depend on the order of erasure.

Hey! We 've verified this expert answer for you, click below to unlock the details :)

I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!

Looking for something else?

Not the answer you are looking for? Search for more explanations.

## More answers

Looking for something else?

Not the answer you are looking for? Search for more explanations.