Back to Table of Contents

13 May 2002 Vol. 7, No. 19 THE MATH FORUM INTERNET NEWS Polynomiography - B. Kalantari Summer 2002 Workshops - Annenberg/CPB Channel | Algorithms POLYNOMIOGRAPHY http://www.polynomiography.com Polynomiography is software for the visualization of polynomials. Developed by Bahman Kalantari, a computer scientist at Rutgers University, Polynomiography does not graph polynomials, but rather represents them using fractal and non-fractal images based on the mathematical convergence properties of iteration functions. Kalantari has used Polynomiography to generate: Surface Design http://www.polynomiography.com/design/ Image Gallery http://www.polynomiography.com/gallery/ Characters http://www.polynomiography.com/characters/ -|-\-/-|-\-/-|-\-/-|-\-/-|-\-/-|-\-/-|-\-/-|-\-/-|-\-/-|-\-/-|- SUMMER 2002 WORKSHOPS - Annenberg/CPB Channel http://www.learner.org/channel/chnnl_schedule.html Many of the Annenberg/CPB Channel's summer workshops and courses will be broadcast on the Channel to accommodate institute-style viewing. The workshops and courses will be aired at the same time time of day, Monday through Thursday, for two weeks. Topics include: - Assessment in Math and Science: What's the Point? - Learning Math: Data Analysis, Statistics, and Probability - Learning Math: Patterns, Functions, and Algebra - Mathematics: What's the Big Idea? - The Missing Link - The Next Move - Private Universe Project in Mathematics Register at no cost by calling (800-LEARNER) or sign up at http://www.learner.org/channel/workshops/registration/registerinfo.html Complete a free workshop or course to earn certificates applicable to inservice requirements or recertification credit. Graduate credit is also available through Colorado State University. http://www.learner.org/channel/workshops/graduate_credit.html -|-\-/-|-\-/-|-\-/-|-\-/-|-\-/-|-\-/-|-\-/-|-\-/-|-\-/-|-\-/-|- ALGORITHMS - National University of Ireland http://www.nuigalway.ie/mat/algorithms/ Plug in your parameters, and these HTML Forms will calculate: - Euclidean GCD Algorithm Using Recursion - Fibonacci Numbers by Iteration - Fibonacci Numbers: O(LOG(n)) by Iteration - Towers of Hanoi - Knapsack Problem Solution by Dynamic Programming - Fibonacci Numbers by Recursion -|-\-/-|-\-/-|-\-/-|-\-/-|-\-/-|-\-/-|-\-/-|-\-/-|-\-/-|-\-/-|- CHECK OUT OUR WEB SITE: The Math Forum http://mathforum.org/ Ask Dr. Math http://mathforum.org/dr.math/ Problems of the Week http://mathforum.org/pow/ Mathematics Library http://mathforum.org/library/ Teacher2Teacher http://mathforum.org/t2t/ Discussion Groups http://mathforum.org/discussions/ Join the Math Forum http://mathforum.org/join.forum.html Send comments to the Math Forum Internet Newsletter editors _o \o_ __| \ / |__ o _ o/ \o/ __|- __/ \__/o \o | o/ o/__/ /\ /| | \ \ / \ / \ /o\ / \ / \ / | / \ / \ |

[**Privacy Policy**]
[**Terms of Use**]

Home || The Math Library || Quick Reference || Search || Help

http://mathforum.org/