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`

`min(remainder(X,seq(A,A,3,1+√(X),2`

^{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 Totient Function Φ(n)** – kg583

This routine calculates the value of Euler's Totient 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).

`2+Xmean(seq(not(remainder(X,A),A,2,X-2`

.