# Category:Wren-math

**Library**

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.

## Pages in category "Wren-math"

The following 170 pages are in this category, out of 170 total.

### A

### C

- Card shuffles
- Carmichael 3 strong pseudoprimes
- Catalan numbers
- Chowla numbers
- Circles of given radius through two points
- Circular primes
- Closest-pair problem
- Consecutive Primes With Ascending Or Descending Differences
- Coprime triplets
- Coprimes
- Count in factors
- Cousin primes
- Cubic Special Primes
- Cumulative standard deviation
- Cyclotomic polynomial

### E

### F

- Factorial base numbers indexing permutations of a collection
- Factors of a Mersenne number
- Factors of an integer
- Farey sequence
- Faulhaber's formula
- Faulhaber's triangle
- Fibonacci word
- File size distribution
- Find first and last set bit of a long integer
- Find if a point is within a triangle
- Find prime n for that reversed n is also prime
- Find prime numbers of the form n*n*n+2
- First perfect square in base n with n unique digits
- First power of 2 that has leading decimal digits of 12
- Free polyominoes enumeration
- Frobenius numbers

### H

### L

### 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 which binary and ternary digit sum are prime
- Numbers with prime digits whose sum is 13
- Numerical integration/Gauss-Legendre Quadrature

### P

- P-Adic numbers, basic
- P-Adic square roots
- P-value correction
- Palindromic primes
- Partition an integer x into n primes
- Pascal matrix generation
- Pascal's triangle
- Perfect numbers
- Permutations
- Pierpont primes
- Piprimes
- Pisano period
- Polynomial regression
- Practical numbers
- Price list behind API
- Primality by Wilson's theorem
- Prime conspiracy
- Prime triplets
- Prime words
- Primes - allocate descendants to their ancestors
- Primes which sum of digits is 25
- Primes with digits in nondecreasing order
- Primorial numbers
- Product of divisors
- Proper divisors

### S

- Safe primes and unsafe primes
- 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 of real numbers
- Set puzzle
- Sexy primes
- Simulated annealing
- Smarandache prime-digital sequence
- Smith numbers
- Special Divisors
- Spoof game
- Statistics/Basic
- Statistics/Normal distribution
- Stern-Brocot sequence
- Strange unique prime triplets
- Strong and weak primes
- Substring primes
- Successive prime differences
- Sum and product of an array
- Sum of divisors
- Sum of the digits of n is substring of n
- Sum to 100
- Summarize and say sequence
- Summarize primes