Please turn JavaScript on

ticalc.org files

Want to stay in touch with the latest updates from Ticalc.org files? That's easy! Just subscribe clicking the Follow button below, choose topics or keywords for filtering if you want to, and we send the news to your inbox, to your phone via push notifications or we put them on your personal page here on follow.it.

Reading your RSS feed has never been easier!

Website title: Welcome - ticalc.org

Is this your feed? Claim it!

Publisher:  Unclaimed!
Message frequency:  0.24 / day

Message History

What if I told you... that I can run a program on my calculator to wirelessly transmit data to my phone? Would you believe me? Draws QR codes on the graph from direct user input or a NoteFolio file. Breaks long inputs into multiple codes. Nearly instantaneous, processing chapter 1 of Moby Dick in less than 2 seconds. The user interface is written in BASIC, which calls an assembl...

Read full story
The RPG Starter Kits were developed to help aspiring programmers with TI BASIC have a solid foundation to begin building an RPG style game with panel style maps (each map segment is the size of the screen). This version comes with a level editor as part of the kit to help programmers build levels much faster to copy/paste them into their data programs.

Read full story
Free throw physics program. Inputs: Height of ball when released and angle of release from free throw line. Calculates the height of the ball at the backboard in feet. Assumes free throw distance is 15 feet. Also assumes average exit velocity of ball of 16 miles per hour.

Read full story
Age of Darkness is a long time RPG project I started for the graphing calculators, starting with the TI-83 back in the late 1990s as a text and menu style RPG, then morphed into a little character that moved across the screen. Fast forward to today, and it's a step closer to what I've always truly envisioned the games to be, adding more and more graphical maps for players to exp...

Read full story
The aliquot function s of a positive integer n returns the sum of n's divisors except n itself. Repeating this procedure gives the aliquot sequence of n. If s(n)=n, n is called a perfect number.

Read full story