Talk:Damm algorithm: Difference between revisions
Content added Content deleted
m (→Unsatisfying) |
m (→Unsatisfying: clarify notation -- sad that no one seems to understand what's going on here, maybe this will help in a small way?) |
||
| Line 36: | Line 36: | ||
└─┴───────────────────┘</pre> |
└─┴───────────────────┘</pre> |
||
And, let's say that the permutation operation phi(x) uses x as an index into the list 0 1 2 9 5 4 8 6 7 3. Then, |
And, let's say that the permutation operation phi(x) uses x as an index into the list 0 1 2 9 5 4 8 6 7 3. Then, {{math|''φ''<sup>''−1''</sup>(''x'')}} would use x as an index into the list 0 1 2 9 5 4 7 8 6 3 (notice that three elements near the right hand of the list have been reordered) and {{math|1=''x'' ⋅ ''y'' = ''φ''<sup>''−1''</sup>(''φ''(''x'') ∗ ''y'')}} would give us this table: |
||
<pre>0 1 2 9 5 4 7 8 6 3 |
<pre>0 1 2 9 5 4 7 8 6 3 |
||