nhyatt/putty-source
1
0
Fork 0
mirror of https://git.tartarus.org/simon/putty.git synced 2025-01-09 17:38:00 +00:00
Code Issues Projects Releases Wiki Activity

test/numbertheory.py: fix comment wording.

Browse Source 
The class for general rth-root finding started off as a cube-root
finder before I generalised it, and in one part of the top-level
explanatory comment, I still referred to a subgroup having index 3
rather than index r.

Also, in a later paragraph, I seem to have said 'index' several times
where I meant the concept of 'rank' I defined in the previous
paragraph.
This commit is contained in:
Simon Tatham 2020-05-03 11:17:55 +01:00
parent 7ffa6ed41e
commit 4948b79114
1 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
test/numbertheory.py
View File

@ -47,7 +47,7 @@ class CyclicGroupRootFinder(object):
#
# We write |G| = r^k u, with u coprime to r. This gives us a
# nested sequence of subgroups G = G_0 > G_1 > ... > G_k, each
# with index 3 in its predecessor. G_0 is the whole group, and the
# with index r in its predecessor. G_0 is the whole group, and the
# innermost G_k has order u.
#
# Within G_k, you can take an rth root by raising an element to
@ -61,9 +61,9 @@ class CyclicGroupRootFinder(object):
# take rth roots of, as above.
#
# In between, you can follow an inductive process, as long as you
# know one element z of index 0. Suppose we're trying to take the
# rth root of some g with index i. Repeatedly multiply g by
# z^{r^i} until its index increases; then take the root of that
# know one element z of rank 0. Suppose we're trying to take the
# rth root of some g with rank i. Repeatedly multiply g by z^{r^i}
# until its rank increases; then take the root of that
# (recursively), and divide off z^{r^{i-1}} once you're done.
def __init__(self, r, order):