ticalc.org files
http://www.ticalc.org
ticalc.org file updatesen-usCopyright (C) 1996-2004, the ticalc.org project. All rights reserved.Wed, 13 Dec 2017 16:48:57 GMTWed, 13 Dec 2017 16:48:57 GMTfilearchive@ticalc.orgfilearchive@ticalc.orghttp://blogs.law.harvard.edu/tech/rssticalc.orghttp://www.ticalc.org/images/ticalc-button.gif
http://www.ticalc.org
8831TI-84 Plus CSE/CE BASIC9K Adventure
http://www.ticalc.org/archives/files/fileinfo/470/47039.html
Introducing an all-new method of calculator text adventures! You, a black dwarf named Grimbis, must recover a magical orb belonging to Gawyn, the lord of all realms. Can you solve the puzzles, recover the orb, and keep the land in eternal winter? NOTE: Intended for TI-84+ CE OS 5.2 or greater.Wed, 13 Dec 2017 16:48:30 GMTTI-84 Plus CSE/CE BASICForced Vibrations v1.01
http://www.ticalc.org/archives/files/fileinfo/470/47038.html
The program finds for the differential equation ( d. e.) of a forced vibration given as m*d2y/dt2 + d*dy/dt + c*t= F0*cos(omega*t) or m*d2y/dt2 + b*dy/dt + c*t= F0*sin(omega*t) the exact solution dependent on preset initial conditions x0, y0(x0), y'0(x0). Wed, 13 Dec 2017 16:48:21 GMTTI-83 Plus/TI-84 PlusCustom Menu Subroutine
http://www.ticalc.org/archives/files/fileinfo/470/47037.html
This menu subroutines allows for the easy creation of scrollable menus by calling this program from within your program. Full documentation and example gifs are included with the download.Tue, 12 Dec 2017 15:56:29 GMTTI-83 Plus/TI-84 PlusAFACTOR4&5
http://www.ticalc.org/archives/files/fileinfo/470/47030.html
These programs are differently built up, than the other programs in the series. They use a polynomial division program to test the factors, instead of the usual algorithm, which is used to find linear integral factors. The advantage is that you can solve equations like: 2x^4+3x^3+6x^2+3x+2= 2x^2+x+1,and x^2+x+2. i.e. factors that are second degree equations, beyond the usual integral factors like: 2x+3, 3x^2-4, 4x^4-7. Also, the use of Euclids algorithm divides out all numbers that are common in the coefficients, wether they are rational or irrational. The drawback is that they run slower. Number 4 is for real factors, and number 5 handles both real and imaginary factors. Both of them can also handle irrational and/or rational coefficients in the equation. They are very compact for what the can achieve.Mon, 11 Dec 2017 19:14:14 GMTTI-83 Plus/TI-84 PlusAPOLYF10
http://www.ticalc.org/archives/files/fileinfo/458/45850.html
This program is an expansion of APOLYFC9 in this directory, for those who wish to also be able to find the non real roots of a one variable polynomial. You enter the equation as it stands in the text book. You can use any variable A to theta. Then you answer wether to search for non real roots or not. Only rational roots though, not irrational. The linear factors are found in the conventional way, and above that the program attempts to "look" at the rest.Mon, 11 Dec 2017 19:14:00 GMTTI-84 Plus CSE/CE BASICAFACTOR3&4
http://www.ticalc.org/archives/files/fileinfo/470/47031.html
These programs are differently built up, than the other programs in the series. They use a polynomial division program to test the factors, instead of the usual algorithm, which is used to find linear integral factors. The advantage is that you can solve equations like: 2x^4+3x^3+6x^2+3x+2= 2x^2+x+1,and x^2+x+2. i.e. factors that are second degree equations, beyond the usual integral factors like: 2x+3, 3x^2-4, 4x^4-7. Also, the use of Euclids algorithm divides out all numbers that are common in the coefficients, wether they are rational or irrational. The drawback is that they run slower. Number 3 is for real factors, and number 4 handles both real and imaginary factors. Both of them can also handle irrational and/or rational coefficients in the equation. They are very compact for what the can achieve.Mon, 11 Dec 2017 19:14:08 GMTTI-NspireHungarian Algorithm
http://www.ticalc.org/archives/files/fileinfo/470/47035.html
This program implements the Hungarian algorithm: Given a positive mxn -Matrix, find an assignment of rows to columns (each row and column may be used at most once) such that the sum of matrix elements is minimal.Mon, 11 Dec 2017 19:14:41 GMT