Talk:Discrete exponential function

Contested deletion

This article should not be speedy deleted as having no substantive content, because... (your reason here) --Garfield Garfield (talk) 19:09, 30 September 2014 (UTC) It does contain content.[reply]

It gives an algorithm for computing the discrete exponential.
It explains why a sophisticated algorithm is needed, to avoid astronomically large numbers.

The algorithm is essentially identical to algorithms already presented at modular exponentiation. Mgnbar (talk) 17:42, 1 October 2014 (UTC)[reply]

This article is redundant with modular exponentiation (see also exponentiation by squaring). Whatever content isn't there should be merged there from here. Mgnbar (talk) 01:56, 2 October 2014 (UTC)[reply]

Support. The two topics are essentially identical, and the phrase "discrete exponential" is the less common. Deltahedron (talk) 06:24, 5 October 2014 (UTC)[reply]
Oppose. The two topics should not be confused. Discrete exponential functions include (or is a umbrela for) two cases: the ordinary discrete exponential function or exponentiation (with integer and fractional exponents) and modular (discrete) exponential based on remainder modulo operation from number theory. Therefore we should structure the content of the article similarly to the article discrete logarithm which presents several types of discrete logarithms including modular discrete logarithm.

(Of course the missing modular logaritm counterpart to modular exponentiation should be created for an exclusive description of that concept not mixed with the ordinary discrete logaritms as integer exponents.)--5.2.200.163 (talk) 15:49, 13 September 2017 (UTC)[reply]