Hadwiger Problem

What is the largest number of subcubes (not necessarily different) into which a Cube cannot be divided by plane cuts? The answer is 47.

• Enneagonal Number
• Enneakaidecagon
• Enneper's Minimal Surface
• Enneper's Negative Curvature Surfaces
• Enneper-Weierstraß Parameterization
• Enormous Theorem
• Enriques Surfaces
• Entire Function
• Entringer Number
• Entropy
• Entscheidungsproblem
• Enumerative Geometry
• Envelope
• Envelope Theorem
• Envyfree
• e-Perfect Number
• Epicycloid
• Epicycloid--1-Cusped
• Epicycloid--2-Cusped
• Epicycloid Evolute
• Epicycloid Involute
• Epicycloid Pedal Curve
• Epicycloid Radial Curve
• Epimenides Paradox
• Epimorphism