Maintenance script: Automated superscript correction

2016-02-24T22:25:55Z

Automated superscript correction

← Older revision		Revision as of 22:25, 24 February 2016
Line 4:		Line 4:
	'''Primality of Positive Integer''' – jonbush; lirtosiast		'''Primality of Positive Integer''' – jonbush; lirtosiast

	This routine works for 3≤X<10^^6^^ and returns 0 if X is composite, and 1 if X is prime.		This routine works for 3≤X<10<sup>6</sup> and returns 0 if X is composite, and 1 if X is prime.
	If used in an If statement or place where the true value does not matter, you can remove the 0≠.		If used in an If statement or place where the true value does not matter, you can remove the 0≠.

Line 11:		Line 11:

	min(remainder(X,seq(A,A,3,1+√(X),2		min(remainder(X,seq(A,A,3,1+√(X),2
	The following code is faster for large or even X, and works for all 0≤X<3.99*10^^6^^.		The following code is faster for large or even X, and works for all 0≤X<3.99*10<sup>6</sup>.

	min(X={2,3,5		min(X={2,3,5

Maintenance script: Initial automated import

2016-02-24T18:39:26Z

Initial automated import

New page

This page is dedicated to showcase small snippets of code that may be useful. These small routines are designed to accomplish tasks involving mathematics. Unless specified, output is in Ans.

------
'''Primality of Positive Integer''' – jonbush; lirtosiast

This routine works for 3≤X<10^^6^^ and returns 0 if X is composite, and 1 if X is prime.
If used in an If statement or place where the true value does not matter, you can remove the 0≠.

min(remainder(X,seq(A,A,2,1+√(X
This code can be modified to be faster if X is already known to be odd.

min(remainder(X,seq(A,A,3,1+√(X),2
The following code is faster for large or even X, and works for all 0≤X<3.99*10^^6^^.

min(X={2,3,5
If X≥7 and fPart(.5X
min(remainder(X,3+2cumSum(not(binompdf(int(.5√(X)),0

'''Euler's Phi Function''' – kg583

This routine calculates the value of [http://en.wikipedia.org/wiki/Euler%27s_totient_function Euler's Phi Function] for any integer X>3.

2+sum(seq(gcd(X,A)=1,A,2,X-2

'''Number of Factors''' – kg583

This routine calculates the number of factors for any integer X>2. A factor is any integer can divide X with no remainder (including 1 and X).

Xmean(seq(not(remainder(X,A),A,1,X[[Category:TI-BASIC]]
[[Category:TIBD]]

TI-BASIC:Math One Liners - Revision history

Maintenance script: Automated superscript correction

Maintenance script: Initial automated import