File: lap.pod

package info (click to toggle)
iceweasel 2.0.0.19-0etch1
  • links: PTS
  • area: main
  • in suites: etch
  • size: 298,784 kB
  • ctags: 317,912
  • sloc: cpp: 1,796,902; ansic: 987,677; xml: 109,036; makefile: 47,777; asm: 35,201; perl: 26,983; sh: 20,879; cs: 6,232; java: 5,513; python: 3,249; pascal: 459; lex: 306; php: 244; csh: 132; objc: 97; yacc: 79; ada: 49; awk: 14; sql: 4; sed: 4
file content (35 lines) | stat: -rw-r--r-- 964 bytes parent folder | download | duplicates (18)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
=head1 NAME

 lap - compute least annihilating power of a number

=head1 SYNOPSIS

 lap <a> <m>

=head1 DESCRIPTION

The B<lap> program computes the order of I<a> modulo I<m>, for
arbitrary precision integers I<a> and I<m>.  The B<order> of I<a>
modulo I<m> is defined as the smallest positive value I<n> for which
I<a> raised to the I<n>th power, modulo I<m>, is equal to 1.  The
order may not exist, if I<m> is composite.

=head1 RESTRICTIONS

This program is very slow, especially for large moduli.  It is
intended as a way to help find primitive elements in a modular field,
but it does not do so in a particularly inefficient manner.  It was
written simply to help verify that a particular candidate does not
have an obviously short cycle mod I<m>.

=head1 SEE ALSO

gcd(1), invmod(1), isprime(1)

=head1 AUTHOR

 Michael J. Fromberger <sting@linguist.dartmouth.edu>
 Thayer School of Engineering, Hanover, New Hampshire, USA
 
 $Date: 2000/07/14 00:44:34 $