conversion of ints and rationals to any base

Project Description
## Purpose

## Motivation

## Algorithmic Complexity

## __str__ method

Release History
Download Files
## Download Files

Conversion of a rational number to a representation in any base. Any rational number can be represented as a repeating sequence in any base. Any integer is representable as a terminating sequence in any base.

This facility does not seem to exist in standard Python numerical packages or standard Python symbolic computation packages. Most likely that is because it falls between the two, as it is precise numerical computation, but involves a symbolic component, the possibly repeating sequence of digits.

The complexity of operations that perform division in an arbitrary base can be quite high. Most methods are annotated with an estimate of their expected complexity in terms of the number of Python operations that they make use of. No differentiation is made among different Python operations. With respect to division in an arbitrary base, the complexity is bounded by the value of the divisor, unless a precision limit is set.

This method does not constitute part of the justbases public API. It is meant to be read by humans, not machines, and may change at any time.

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

File Name & Checksum SHA256 Checksum Help | Version | File Type | Upload Date |
---|---|---|---|

justbases-0.12.tar.gz (33.6 kB) Copy SHA256 Checksum SHA256 | – | Source | Sep 19, 2016 |