| File information | File size | Options |
Original JPG File1755 × 1755 pixels (3.08 MP) 14.9 cm × 14.9 cm @ 300 PPI | 65 KB | Download |
Screen800 × 800 pixels (0.64 MP) 6.8 cm × 6.8 cm @ 300 PPI | 37 KB | Download |
PreviewScreen Preview | 37 KB | View |
588
Open
Frederik Wellmann
A. MS.
MATHEMATICS (MS 1-278)
In how many ways, with c colors, can a simple chain of 1 links be colored, no two adjacent links being colored alike? In how may ways, with c + l colors, can a simple chain of I + l links be colored so that all adjacent links are colored differently?
graphics, topical (topics or topology), fourcolor problem (Map), Mathematics
16 pp.
1897/1900~?
157
n.p.
MATHEMATICS / TOPICAL GEOMETRY
yes
Seven pages added from fragments; one page from MS. 839
