An algorithm that computes modular nested exponents (or towers) efficiently.
Project description
modular-towers
An algorithm that computes modular nested exponents (or towers) efficiently.
🚩 Table of Contents
🗺️ Overview
modular-towers exports a Python function mod_tower that takes as input an arbitrarily long sequence of positive integers a₁, a₂, ..., aₙ and a positive integer m and computes a₁^(a₂^(···^aₙ)) mod m efficiently (that is, without computing the value of the nested exponent).
🔧 Installing
Installing with pip is the easiest:
$ pip install modular-towers
A development version can be installed from GitHub
using setuptools, provided you have sympy installed already:
$ git clone https://github.com/avivbrook/modular-towers
$ cd modular-towers
$ python setup.py install
💡 Examples
>>> from modular_towers import mod_tower as modtow
>>> modtow([6,5,4,3,2], 1948502738) # 6^(5^(4^(3^2))) mod 1948502738
951546056
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
modular-towers-0.1.tar.gz
(17.0 kB
view hashes)
Built Distribution
Close
Hashes for modular_towers-0.1-py3-none-any.whl
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | 269a2d455145ad45129d79c541ba94595fd638073e975b1ad64ffbbd5ff9c0b2 |
|
| MD5 | d55707a62178d5be2c1fb960428d6402 |
|
| BLAKE2b-256 | 2765b5fbacaba0ae5a0cfc349b3e9153c19c5d9c2a14541b7cca1742ef450c7d |
