# 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. 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 225 total.

(previous page) (next page)### A

### B

### C

- Carmichael 3 strong pseudoprimes
- Catalan numbers
- Catmull–Clark subdivision surface
- 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
- Cycles of a permutation
- Cyclotomic polynomial

### D

### E

### F

- 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

### 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 which are not the sum of distinct squares
- Numbers which binary and ternary digit sum 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
- Perfect 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
- Primality by Wilson's theorem
- 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 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
- Sexy primes
- Simulated annealing
- Smallest multiple
- Smarandache prime-digital sequence
- Smith numbers
- Sort primes from list to a list
- Special divisors
- Special neighbor primes
- Spoof game
- Statistics/Basic
- Statistics/Normal distribution
- Stern-Brocot sequence
- Strange unique prime triplets
- Strong and weak primes
- Sub-unit squares
- Substring primes
- Successive prime differences
- Sum and product of an array
- Sum of divisors
- Sum of primes in odd positions is prime
- Sum of square and cube digits of an integer are primes
- Sum of the digits of n is substring of n
- Sum of two adjacent numbers are primes
- Sum to 100
- Summarize and say sequence
- Summarize primes
- Summation of primes
- Super-Poulet numbers