# Category:Wren-big

**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-big** is a module which adds support for arbitrary precision arithmetic to the Wren programming language. It consists of 6 classes: BigInt, BigRat, BigDec, BigInts, BigRats and BigDecs. The latter three contain static methods for dealing with lists of BigInt, BigRat and BigDec objects respectively. BigInts also contains instance methods for creating and iterating through ranges of BigInts.

It is the tenth 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 you need to copy the source code (in the talk page) to a text file called *big.wren* and place this in the same directory as the importing script so the command line interpreter can find it.

As there is a dependency on the *Wren-trait* module, you also need to copy that (if it is not already present) to the same directory as described here. Unless you are using classes in that module directly, there is no need to *import* them into your script and the *Comparable* class can even be imported via Wren-big itself.

Wren-big also has a dependency on the Random module which is an optional part of Wren's standard library.

## Pages in category "Wren-big"

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

### A

### C

### E

### F

### I

### M

### P

- P-Adic square roots
- Padovan sequence
- Paraffins
- Parse an IP Address
- Partition function P
- Pathological floating point problems
- Pell numbers
- Pell's equation
- Permutations/Derangements
- Pi
- Pierpont primes
- Population count
- Posit numbers/decoding
- Powerful numbers
- Prime decomposition
- Primorial numbers
- Pseudo-random numbers/PCG32
- Pseudo-random numbers/Splitmix64
- Pseudo-random numbers/Xorshift star

### S

- Sequence of primorial primes
- Sequence: nth number with exactly n divisors
- Smallest multiple
- Smallest numbers
- Smallest power of 6 whose decimal expansion contains n
- Solve hanging lantern problem
- Special factorials
- Square form factorization
- Square root by hand
- Stirling numbers of the first kind
- Stirling numbers of the second kind
- Suffixation of decimal numbers
- Super-d numbers
- Sylvester's sequence