Using the TIC-80 fantasy console simulator on your pi, implement a program that visually displays a range of values (lower and upper bounds adjustable by the user) that colorfully displays whether each value is a prime or composite value.

The algorithm you are to implement is the trial-by-division brute force (naive: NO optimizations)

Time how long it takes to execute (displaying elapsed time for the run at its conclusion; this is useful for comparisons).

Additionally, the entire class will be participating in documenting and filling out this project page. It is the responsibility of EACH class member to:

• ask copious, clarifying questions (so you can better add content)
• craft a coherent and organized document, with information located under pertinent headings
• explain the fundamentals of the process, conceptual background, algorithmic approach, and you can even suggest particulars related to TIC-80 (certain functions that might prove useful- individual, unrelated snippets to do things like capturing time, or displaying text, etc.)
• to get full credit, each individual that submits must perform no fewer than 4 changes to this document (as viewable from the wiki revision system). Failure to do so will result in documentation penalties being applied.

As it is an intentionally minimally optimized (in a way, optimally suboptimal) method, going about this task will be relatively simple, relying on three major areas: user interaction/input, prime checking, and visual output. Chronologically, upon run, the program will execute essentially the following steps:

1. Request input
   1. Store
2. Pass input to prime checker
   1. Return True/False for Prime/Composite
3. Use return value of prime checker to determine output
   1. If prime, positive output (e.g. rainbow/green/bright)
   2. If composite, negative/neutral output (e.g. monochrome/red/dull)