Intensity/Illumination, Days Since Jan.Fractal Plots: TI-84 Plus CE and HP Prime.HP Prime and HP 17BII: Trapezoid Rule Using Distin.This blog entry may be distributed for noncommercial purposes, provided that full credit is given to the author. Unauthorized use and/or unauthorized distribution for commercial purposes without express and written permission from the author is strictly prohibited. INPUT( ) Īll original content copyright, © 2011-2019. (updated - this allows for copying the code to the HP Prime connectivity kit/emulator) Note: I use the parenthesis notation (x,y) for the complex number x + yi because the imaginary character i unfortunately does not transfer to computer text. Because of the faster processor and calculating speed, I have increased the number of grid points to 500. I set 18 color levels, starting from white to black. HP Prime Program CHAOS1 (File: CHAOS1.hpprgm) The list of colors that I use in this code is: TI-84 Plus CE Program CHAOS1 (File: CHAOS1.8xp)įor the Ti-84 Plus CE, I recommend the number of grid points of no more than 75. You can download CHAOS1 for both the TI-84 Plus CE and HP Prime here: Keep in mind the TI-84 Plus CE has up to 15 colors, the Casio fx-CG50 has up to 7, and the HP Prime's colors have 256 levels of red, green, and blue. With the programs listed, you can adjust the number of colors. Obviously the more levels (colors) we have, the more accurate our fractal is. Hence for each point, if |z| ≤ 2 after 9 iterations, color the point black. For example, I picked 9 colors for the TI-84 Plus CE version. This method creates the Julia set for any given c.įor the program CHAOS1, I set up a rank of colors to plot each point, and arbitrary pick a maximum amount of iterations. For such points that fit criteria 2, and never reaches |z| >2, the point is colored black. The color is determined by the amount of iterations it takes to reach |z| > 2. |z_n| = abs(z_n) eventually settles (or converges) to a specific point.Ī color is assigned to each point z_0. |z_n| = abs(z_n) eventually goes towards infinity orĢ. Then we calculate:įor each z_0, we have two possibilities for the repeated calculations:ġ. We start with each point on the graph z_0 = a + b*i, where i = √-1. The higher G is, the more detailed the fractal is however, the plot will take longer to complete. The program CHAOS1 will also as for the number of points (G), this will determine the number of points plotted in the graph. The program will ask for a sample graphing space with the a border B. Given the complex numbers z_k and c, repeats the equation: The program CHAOS1 plots a fractal to simulate a Julia Set. Fractal Plots: TI-84 Plus CE and HP Prime

Ti 84 emulator on ti 84 plus ce