User:Tntarrh

Hello! My name is Tntarrh, and I am a teenager in the 8th grade living in Chesterfield County, VA. I love doing random math, as I am excessively good at it, especially geometry, and especially-especially 4-dimensional geometry. Fractals also interest me. I am a devoted Christian, and my hobbies include drawing, clarinet playing, and discovering the patterns of math. My life goal is to have an actual Wikipedia article about me. If you like fractals and you haven't been to recursivedrawing.com, you should try it.

One of the many mathematical things I have discovered on my own has to do with the hyper-cube series (point, line, square, cube, tesseract, etc.).The amount of hyper-cube objects (lets call it the hyper-cube object in the n dimension) contained in a different hyper-cube object ( hyper-cube object in m-D) is equal to 2*(# of (n-1-dimensional hyp.cubeobjs. contained in a (m)-dimensional HCO)+(# of (n-1) dimensional HCO's contained in a (m-1) dimensional HCO) as long as m>n and m and n are non-negative integers. For example: # of squares in a cube=2(# squares in a square) + (# of lines in a square), which is the same as 6=2(1)+4. I know it's hard to digest at first, but you'll get it. Maybe. There are similar equations for other series, such as the simplex and orthoplex (duel of hyper-cube).