Lesson plan

Magic hypercube

In mathematics, a magic hypercube is the k-dimensional generalization of magic squares and magic cubes, that is, an n × n × n × ... × n array of integers such that the sums of the numbers on each pillar (along any axis) as well as on the main space diagonals are all the same. The common sum is called the magic constant of the hypercube, and is sometimes denoted M k (n). If a magic hypercube consists of the numbers 1, 2, ..., n k , then it has magic number : M_k(n) = \frac{n(n^k+1)}{2} . For k = 4, a magic hypercube may be called a magic tesseract, with sequence of magic numbers given by . The side-length n of the magic hypercube is called its order. Four-, five-, six-, seven- and eight-dimensional magic hypercubes of order three have been constructed by J. R. Hendricks. Marian Trenkler proved the following theorem: A p-dimensional magic hypercube of order n exists if and only if p > 1 and n is different from 2 or p = 1. A construction of a magic hypercube follows from the proof. The R programming language includes a module, library(magic) , that will create magic hypercubes of any dimension with n a multiple of 4.

Back to article

Article summary

In mathematics, a magic hypercube is the k-dimensional generalization of magic squares and magic cubes, that is, an n × n × n × ... × n array of integers such that the sums of the numbers on each pillar (along any axis) as well as on the main space diagonals are all the same. The common sum is called the magic constant of the hypercube, and is sometimes denoted M k (n). If a magic hypercube consists of the numbers 1, 2, ..., n k , then it has magic number : M_k(n) = \frac{n(n^k+1)}{2} . For k = 4, a magic hypercube may be called a magic tesseract, with sequence of magic numbers given by . The side-length n of the magic hypercube is called its order. Four-, five-, six-, seven- and eight-dimensional magic hypercubes of order three have been constructed by J. R. Hendricks. Marian Trenkler proved the following theorem: A p-dimensional magic hypercube of order n exists if and only if p > 1 and n is different from 2 or p = 1. A construction of a magic hypercube follows from the proof. The R programming language includes a module, library(magic) , that will create magic hypercubes of any dimension with n a multiple of 4.

Key claims

  1. publication date: 2000 — source: Wikipedia, revision 1372903878, retrieved 2026-10-20 · confidence 0.95
  2. publication date: 1998 — source: Wikipedia, revision 1372903878, retrieved 2026-10-20 · confidence 0.95

Discussion questions

  1. Summarise the article in your own words. Which single claim would you verify first, and why?
  2. The record states that the publication date is "2000". What evidence would count against this claim?
  3. The record states that the publication date is "1998". What evidence would count against this claim?
  4. Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
  5. If two sources disagreed about one of these facts, what would you need in order to trust one over the other?

Bibliography

  1. Wikipedia, “Magic hypercube”, revision 1372903878, retrieved 2026-10-20 https://en.wikipedia.org/w/index.php?oldid=1372903878

Key claims and bibliography are generated from the same tracked claims and sources as the article page.