# 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 class. It consists of static methods organized into 3 classes: Math, Int and Nums. The latter two classes contain methods specific to integer and number sequences respectively.

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 113 pages are in this category, out of 113 total.

### A

### C

### E

### F

### L

### N

### P

- P-Adic numbers, basic
- P-Adic square roots
- Partition an integer x into n primes
- Pascal matrix generation
- Pascal's triangle
- Perfect numbers
- Permutations
- Pierpont primes
- Pisano period
- Polynomial regression
- Price list behind API
- Primality by Wilson's theorem
- Prime conspiracy
- Prime words
- Primes - allocate descendants to their ancestors
- 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
- Sexy primes
- Smarandache prime-digital sequence
- Smith numbers
- Statistics/Basic
- Stern-Brocot sequence
- Strong and weak primes
- Successive prime differences
- Sum and product of an array
- Sum of divisors
- Summarize and say sequence