Category:Wren-math
This is an example of a library. You may see a list of other libraries used on Rosetta Code at Category:Solutions by Library.
Wren-math is a module which supplements the methods in the Wren programming language's Num and Bool classes. It consists of static methods organized into 4 classes: Math, Int, Nums and Boolean. Int and Nums contain methods specific to integer and number sequences respectively. Boolean enables bitwise operations to be performed on boolean values.
It is the fourth in a series of modules (listed on the language's main page) designed to assist with writing Rosetta Code tasks so the same code does not have to be written or copy/pasted time and time again thereby bloating a task's script code unnecessarily.
To use it all you need to do is to copy the source code (in the talk page) to a text file called math.wren and place this in the same directory as the importing script so the command line interpreter can find it. However, if you are using this module within a DOME script, then the source code should be copied instead to a text file called math2.wren (and accessed with: import "./math2") to avoid a conflict with the built-in math module.
Pages in category "Wren-math"
The following 200 pages are in this category, out of 258 total.
(previous page) (next page)A
B
C
- Calmo numbers
- CalmoSoft primes
- Carmichael 3 strong pseudoprimes
- Carmichael lambda function
- Catalan numbers
- Catmull–Clark subdivision surface
- Centroid of a set of N-dimensional points
- Chowla numbers
- Circles of given radius through two points
- Circular primes
- Closest-pair problem
- Collect and sort square numbers in ascending order from three lists
- Colorful numbers
- Composite numbers k with no single digit factors whose factors are all substrings of k
- Concatenate two primes is also prime
- Consecutive primes with ascending or descending differences
- Coprime triplets
- Coprimes
- Count in factors
- Cousin primes
- Cubic special primes
- Cumulative standard deviation
- Curzon numbers
- Cycles of a permutation
- Cyclops numbers
- Cyclotomic polynomial
D
E
- Earliest difference between prime gaps
- Eisenstein primes
- EKG sequence convergence
- Elliptic Curve Digital Signature Algorithm
- Emirp primes
- Erdös-Selfridge categorization of primes
- Erdős-Nicolas numbers
- Erdős-primes
- Evaluate binomial coefficients
- Even numbers which cannot be expressed as the sum of two twin primes
- Extra primes
- Extreme primes
F
- Factor-perfect numbers
- Factorial base numbers indexing permutations of a collection
- Factorial primes
- Factors of a Mersenne number
- Factors of an integer
- Farey sequence
- Faulhaber's formula
- Faulhaber's triangle
- Fermat pseudoprimes
- File size distribution
- Find adjacent primes which differ by a square integer
- Find prime n such that reversed n is also prime
- Find prime numbers of the form n*n*n+2
- Find squares n where n+1 is prime
- First 9 prime Fibonacci number
- First perfect square in base n with n unique digits
- First power of 2 that has leading decimal digits of 12
- Fortunate numbers
- Free polyominoes enumeration
- Frobenius numbers
G
H
L
M
N
- N-smooth numbers
- Neighbour primes
- Next special primes
- Nice primes
- Nonoblock
- Nonogram solver
- Numbers divisible by their individual digits, but not by the product of their digits.
- Numbers k such that the last letter of k is the same as the first letter of k+1
- Numbers which are not the sum of distinct squares
- Numbers which are the cube roots of the product of their proper divisors
- Numbers whose binary and ternary digit sums are prime
- Numbers whose count of divisors is prime
- Numbers with prime digits whose sum is 13
P
- P-value correction
- Pairs with common factors
- Palindromic primes
- Palindromic primes in base 16
- Pan base non-primes
- Pandigital prime
- Parallel calculations
- Partition an integer x into n primes
- Pascal matrix generation
- Pascal's triangle
- Pell numbers
- Penholodigital squares
- Perfect numbers
- Perfect totient numbers
- Permutations
- Permuted multiples
- Piprimes
- Pisano period
- Polynomial regression
- Positive decimal integers with the digit 1 occurring exactly twice
- Practical numbers
- Price list behind API
- Prime conspiracy
- Prime numbers p for which the sum of primes less than or equal to p is prime
- Prime numbers which contain 123
- Prime numbers whose neighboring pairs are tetraprimes
- Prime triplets
- Prime words
- Primes - allocate descendants to their ancestors
- Primes which contain only one odd digit
- Primes whose first and last number is 3
- Primes whose sum of digits is 25
- Primes with digits in nondecreasing order
- Primorial numbers
- Product of divisors
- Product of min and max prime factors
- Proper divisors
R
S
- Safe and Sophie Germain primes
- Safe primes and unsafe primes
- Selection bias in clinical sciences
- Sequence of primorial primes
- Sequence: nth number with exactly n divisors
- Sequence: smallest number greater than previous term with exactly n divisors
- Sequence: smallest number with exactly n divisors
- Set puzzle