|
File Archives
|
|
TI-NSPIRE PYTHON MATH PROGRAMS
|
Archive Statistics
|
|
Number of files
|
4
|
|
Last updated
|
Sunday, 9 July 2023
|
|
Total downloads
|
1,812
|
|
Most popular file
|
 Factoriser with 650 downloads.
|
|
Click a filename to download that file.Click a folder name to view files in that folder.Click for file information. Icon legend: File with screen shots File with animated screen shots File with reviews Featured programs
| Name | Size | Date | Rating | Description |
| (Parent Dir) | folder | | Up to TI-Nspire Python Files | | pyt_trip.zip | 2k | 23-07-09 |  | Pythagorean Triples
Calculates Pythagorean triples for a given natural number. The list is sorted ascending by the smallest angle. It is a tool for creating exercises of right triangles with nice solutions. | | modpowers.tns.zip | 1k | 20-12-16 | | Modular powers/exponents
Will calculate a^kmodn (calculates modular powers/exponents). given one wants to calculate a^kmodn input modpower(a,k,n) and the output will be the value of a^kmodn this algorithm uses the exponentiation property of modular arithmetic. Also note that one needs to run the program in the shell first before running the modpower function. | | factorising.tns.zip | 1k | 20-12-11 | | Factoriser
Factorises a given number. For some number n, input factor(n) for a list of the factors, of n. Note that this is a python program and requires a Ti Nspire CX ii/CX ii, with operating system 5.2 or newer to run. Also note that one must first run the program, factorising.py, in the python shell and then the function, factor(n). | | lineardiophantineequation.zip | 2k | 20-12-07 | | Linear Diophantine Equations Solver
This program will solve linear Diophantine equations. It only works on the Ti Nspire CX II or CX II CAS, and requires OS 5.20 or greater. To solve linear Diophantine equations in the form ax+by=c, first run the program, and, then, simply input isolve(a,b,c) in the python shell provided. |
|
|
|
