Title of article
The solvability of a set partitioning problem and a logical mistake in article 2 of the U.S. Constitution
Author/Authors
Belenky، نويسنده , , A.S.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2004
Pages
3
From page
1
To page
3
Abstract
An elementary proof of the solvability of a set partitioning problem of a special kind is presented. The solvability of this problem, in particular, means that a requirement from Article 2 of the U.S. Constitution might not be met in U.S. Presidential elections held under the double-balloting principle of casting the electoral votes by the Electoral College when the number of all the appointed electors was even.
Keywords
Partitioning problem , Article 2 of the U.S. Constitution
Journal title
Mathematical and Computer Modelling
Serial Year
2004
Journal title
Mathematical and Computer Modelling
Record number
1593229
Link To Document