-
D31. Mono Nonograms
Posted: 2025-12-24 16:13:37 Solutions will be accepted through 2025 Jan 2These problems are based on a type of puzzle called a nonogram: you are given a grid (usually a rectangular portion of a square grid), and each row and column is labeled with a list of numbers that gives the sizes of the blocks of consecutive squares that should be colored black in that row…
-
D23. Factor Network
Posted: 2024-09-30 15:39:23You want to label the vertices (corners) of a regular octahedron (see Figure 3) with whole numbers bigger than one so that the labels of two vertices have a common factor (bigger than one) if and only if they are adjacent on the octahedron (connected by an edge). Is it possible? If so, what is…