Prove that there exists no deterministic algorithm for election in rings of known, even size where communication is by synchronous message passzng.
Generalize the proof to show the impossibility of election for all composite ring sizes.
Text Book: Introduction to Distributed Algorithms By Gerard Tel.