Editing Magic hypercube (section)

===Latin prescription construction===
(modular equations).
This method is also specified by an n by n+1 matrix. However this time it multiplies the n+1 vector  [x<sub>0</sub>,..,x<sub>n-1</sub>,1], After this multiplication the result is taken modulus m to achieve the n (Latin) hypercubes:
 LP<sub>k</sub> = ( <sub>l=0</sub>Σ<sup>n-1</sup> LP<sub>k,l</sub> x<sub>l</sub> + LP<sub>k,n</sub> ) % m
of radix m numbers (also called "'''digits'''"). On these LP<sub>k</sub>'s "'''digit changing'''" (?i.e. Basic manipulation) are generally applied before these LP<sub>k</sub>'s are combined into the hypercube:
 <sup>n</sup>H<sub>m</sub> = <sub>k=0</sub>Σ<sup>n-1</sup> LP<sub>k</sub> m<sup>k</sup>

'''J.R.Hendricks''' often uses modular equation, conditions to make hypercubes of various quality can be found on [http://www.magichypercubes.com/Encyclopedia http://www.magichypercubes.com/Encyclopedia] at several places (especially p-section)

Both methods fill the hypercube with numbers, the knight-jump guarantees (given appropriate vectors) that every number is present. The Latin prescription only if the components are orthogonal (no two digits occupying the same position)