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

### A

### C

### E

### F

### L

### N

### P

### S

- Sequence of primorial primes
- Sequence: smallest number greater than previous term with exactly n divisors
- Sequence: smallest number with exactly n divisors
- Sexy primes
- Smarandache prime-digital sequence
- Smith numbers
- Statistics/Basic
- Strong and weak primes
- Successive prime differences
- Sum and product of an array
- Sum of divisors
- Summarize and say sequence