1 |
%$Header: /home/dashley/cvsrep/uculib01/uculib01/doc/manual/c_glo0/c_glo0.tex,v 1.3 2010/03/16 21:56:02 dashley Exp $ |
2 |
|
3 |
\chapter{Glossary Of Terms} |
4 |
\markboth{GLOSSARY OF TERMS}{GLOSSARY OF TERMS} |
5 |
|
6 |
\label{cglo0} |
7 |
|
8 |
\begin{vworktermglossaryenum} |
9 |
|
10 |
|
11 |
\item \textbf{cardinality}\index{cardinality} |
12 |
|
13 |
The cardinality of a set is the |
14 |
number of elements in the set. In this work, the cardinality |
15 |
of a set is denoted $n()$. For example, |
16 |
$n(\{12,29,327\}) = 3$. |
17 |
|
18 |
\item \textbf{coprime}\index{coprime} |
19 |
|
20 |
Two integers that share no prime factors are \emph{coprime}. |
21 |
\emph{Example:} |
22 |
6 and 7 are coprime, whereas 6 and 8 are not. |
23 |
|
24 |
\item \textbf{GMP}\index{GMP} |
25 |
|
26 |
The \emph{G}NU \emph{M}ultiple \emph{P}recision library. |
27 |
The GMP is an arbitrary-precision integer, rational number, |
28 |
and floating-point library that places no restrictions on |
29 |
size of integers or number of significant digits in floating-point |
30 |
numbers. This |
31 |
library is famous because it is the fastest of its |
32 |
kind, and generally uses asymptotically superior algorithms. |
33 |
|
34 |
\item \textbf{greatest common divisor (g.c.d.)} |
35 |
|
36 |
The greatest common divisor of two integers is the largest |
37 |
integer which divides both integers without a remainder. |
38 |
\emph{Example:} the g.c.d. of 30 and 42 is 6. |
39 |
|
40 |
\item \textbf{irreducible} |
41 |
|
42 |
A rational number $p/q$ where $p$ and $q$ are coprime |
43 |
is said to be \emph{irreducible}. |
44 |
Equivalently, it may be stated that $p$ and $q$ share no prime factors |
45 |
or that the greatest common divisor of |
46 |
$p$ and $q$ is 1. |
47 |
|
48 |
%\item \textbf{KPH} |
49 |
% |
50 |
% Kilometers per hour. |
51 |
% |
52 |
%\item \textbf{limb}\index{limb} |
53 |
% |
54 |
% An integer of a size which a machine can manipulate natively |
55 |
% that is arranged in an array to create a larger |
56 |
% integer which the machine cannot manipulate natively and must be |
57 |
% manipulated through arithmetic subroutines. |
58 |
% |
59 |
%\item \textbf{limbsize}\index{limbsize} |
60 |
% |
61 |
% The size, in bits, of a limb. The limbsize usually represents |
62 |
% the size of integer that a machine can manipulate directly |
63 |
% through machine instructions. For an inexpensive microcontroller, |
64 |
% 8 or 16 is a typical limbsize. For a personal computer or |
65 |
% workstation, 32 or 64 is a typical limbsize. |
66 |
% |
67 |
%\item \textbf{MPH} |
68 |
% |
69 |
% Miles per hour. |
70 |
|
71 |
\end{vworktermglossaryenum} |
72 |
|
73 |
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% |
74 |
|
75 |
\noindent\begin{figure}[!b] |
76 |
\noindent\rule[-0.25in]{\textwidth}{1pt} |
77 |
\begin{tiny} |
78 |
\begin{verbatim} |
79 |
$RCSfile: c_glo0.tex,v $ |
80 |
$Source: /home/dashley/cvsrep/uculib01/uculib01/doc/manual/c_glo0/c_glo0.tex,v $ |
81 |
$Revision: 1.3 $ |
82 |
$Author: dashley $ |
83 |
$Date: 2010/03/16 21:56:02 $ |
84 |
\end{verbatim} |
85 |
\end{tiny} |
86 |
\noindent\rule[0.25in]{\textwidth}{1pt} |
87 |
\end{figure} |
88 |
|
89 |
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% |
90 |
%$Log: c_glo0.tex,v $ |
91 |
%Revision 1.3 2010/03/16 21:56:02 dashley |
92 |
%Edits and corrections. |
93 |
% |
94 |
%Revision 1.2 2010/01/28 21:18:32 dashley |
95 |
%a)Chapter start quotes removed. |
96 |
%b)Aesthetic comment line added at the bottom of most files. |
97 |
% |
98 |
%Revision 1.1 2007/08/30 14:42:04 dtashley |
99 |
%Initial checkin. |
100 |
% |
101 |
%End of file $RCSfile: c_glo0.tex,v $. |
102 |
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% |
103 |
|