Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » Math Topics » geometry.puzzles.independent

Topic: A constrained fractal
Replies: 17   Last Post: Jul 15, 2006 3:28 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
cuthbert

Posts: 10
Registered: 6/26/06
Re: A constrained fractal (2ºCorrection!)
Posted: Jul 14, 2006 8:50 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

Oh boy. What can I say? I've been away a couple of weeks, so sorry not to respond.

I've put some thought into this and will post more fully next week. I came up with a series of numbers of triangles produced at each iteration up to about 10th. I can work out an algorithm for the number of triangles at the k-th iteration given the number at the k-1 th iteration; that is, I can't tell you the number at iteration N.

The only obvious side to this problem is that the perimeter's infinite. Heh.

Guys, I have to confess my status here. I'm a high school level (though not age..) mathematician. For all I know I could have posted a problem that's a classic with an easy answer. I don't know what an eigenvalue is. I don't know whether I'll have any useful insights.

Lastly, I hope I haven't contravened etiquette - is it OK to post problems when you don't have much of a solution yourself?

I hope the puzzle gave you some pleasure, anyhow...!

many thanks, Stephen (Cuthbert)



Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.