Relatively Prime Numbers Problem

 Hi folks! Here's the puzzle. Basically, it arose by drawing graphs where each vertex is a number and each edge connects factors to their multiples. A simple example would be the following graph:

With that construction in place, here is the actual question. How can we label the vertices of a cube such that it follows these rules (such that vertices are connected by an edge iff one is a multiple of the other). There are of course infinite ways of doing this labelling, but my challenge to you is to do the labelling with the smallest whole numbers possible!



Comments

Popular posts from this blog

Euclid Alone Has Looked On Beauty Bare

45 Factor Table Entries