Category:PL/M
This programming language may be used to instruct a computer to perform a task.
| See Also: |
|
|---|
Subcategories
This category has the following 3 subcategories, out of 3 total.
@
- PL/M examples needing attention (empty)
- PL/M Implementations (1 P)
- PL/M User (3 P)
Pages in category "PL/M"
The following 166 pages are in this category, out of 166 total.
A
C
D
E
F
H
I
L
M
N
- N'th
- N-grams
- Narcissistic decimal number
- Nice primes
- Non-decimal radices/Convert
- Number names
- Numbers divisible by their individual digits, but not by the product of their digits.
- Numbers in base 10 that are palindromic in bases 2, 4, and 16
- Numbers in base-16 representation that cannot be written with decimal digits
- Numbers which are the cube roots of the product of their proper divisors
- Numbers whose binary and ternary digit sums are prime
P
R
S
- Safe and Sophie Germain primes
- Semiprime
- Sequence: smallest number greater than previous term with exactly n divisors
- Set consolidation
- Show ASCII table
- Sierpinski triangle
- Sieve of Eratosthenes
- Smallest square that begins with n
- Smith numbers
- Sorting algorithms/Gnome sort
- Sorting algorithms/Heapsort
- Sorting algorithms/Insertion sort
- Special divisors
- Special neighbor primes
- Special pythagorean triplet
- Sphenic numbers
- Square but not cube
- Steady squares
- Stern-Brocot sequence
- Strange numbers
- Strange plus numbers
- Strip a set of characters from a string
- Sum digits of an integer
- Sum of divisors
- Sum of elements below main diagonal of matrix
- Sum of first n cubes
- Sum of squares
- Sum of the digits of n is substring of n
- Sum of two adjacent numbers are primes
- Sylvester's sequence
- Syntax highlighting using Mediawiki formatting