Math Magic is a web site devoted to
original mathematical recreations. If you have a math puzzle, discovery, or observation, please e-mail me about it. You can also send answers to the problem of the month. |

Math Magic Archive |

**g(n)** = the smallest number of cubes

**h(n)** = the smallest possible value of the largest multiplicity of cubes needed

When n is composite with smallest prime factor p, it appears that f(n) = n/p f(p) and g(n) = g(p). Can you find counter-examples? Thus we mostly concern ourselves with finding the values of f(n) and g(n) for n prime.

Can you beat the best known tilings below?

In particular, what is the smallest n for which f(n) = k? How fast does g(n) grow? What is the smallest n for which different packings are needed to illustrate f(n) and g(n)? What is lim_{n→∞} h(n) ? It is known that no n has h(n)=1. Are there n for which h(n)=2?

And a meta-question: what is the best way to visualize complicated cube packings?

You can see all the best-known results here.

Submit your answers here.

Weekly Puzzle Sites: | | Ken Duisenberg | NPR | Puzzability | The Griddle | Puzzle Picnic | Nick's | |

Other Puzzle Sites: | | MathPuzzle.com | IBM | Retrograde Analysis | Puzzle Palace | Terry Stickels | |

Interactive Puzzle Sites: | | Click Mazes | Puzzle Beast | Logic Mazes | Color Shift | Grid 1 | 2 | Boomshine | |

Physics-Based Puzzle Sites: | |
Perfect Balance 1 |
2 |
Assembler 1 |
2 |
3 |
4 | | Color Infection | Redstar Fall 1 | 2 | Fantastic Contraption | |

Colleges with Puzzles: | | Macalester | Missouri State | Purdue | |

Great Math Sites: | | Geometry Junkyard |
Math World |
Mathematician Biographies |
| Integer Sequences | Inverse Calculator | Geometric Dissections | |

Recreational Math Sites: | | Mike Keith |
Harvey Heinz |
Primes |
GIMPS |
| Polyforms | World of Numbers | Soup Kitchen | |