The ordered pair $(a,b)$ can be chosen in 16 ways so as not to be a multiple of $(c,d)$.
There cannot be two edges between one pair of vertices.
Write out the integers from 1 to $n$. Pair up the first and the last, the second and next to last, etc.
Go to the list of words starting with: a
Copyright © 2011 by Jerzy Trzeciak, Warszawa 2011. All rights reserved.
Copyright © 2006-2011 by IMPAN. All rights reserved.
Copyright © 2006-2012 by IMPAN. All rights reserved.