Addition-chain exponentiation
id:
addition-chain-exponentiation-253-14006841
title:
Addition-chain exponentiation
text:
In mathematics and computer science, optimal addition-chain exponentiation is a method of exponentiation by a positive integer power that requires a minimal number of multiplications. Using the form of the shortest addition chain, with multiplication instead of addition, computes the desired exponent (instead of multiple) of the base. (This corresponds to OEIS sequence A003313 (Length of shortest addition chain for n).) Each exponentiation in the chain can be evaluated by multiplying two of the
brand slug:
wiki
category slug:
encyclopedia
description:
Method of exponentiation by positive integers requiring a minimal number of multiplications
original url:
https://en.wikipedia.org/wiki/Addition-chain_exponentiation
date created:
date modified:
2023-01-27T23:16:46Z
main entity:
{"identifier":"Q4681307","url":"https://www.wikidata.org/entity/Q4681307"}
image:
fields total:
13
integrity:
14