The impossibility or inability to download long-arithmetic, signed as 1.-- and 2.--

[Petr Kurka]

1.-- High-level signed integer arithmetic functions (mpz). There are about
140 arithmetic and logic functions in this class.

2.-- High-level rational arithmetic functions (mpq). This class consists of
about 35 functions, but all signed integer arithmetic functions can be used
too, by applying them to the numerator and denominator separately.

High-level floating-point arithmetic functions (mpf). This is the GMP
function class to use if the C type `double' doesn't give enough precision
for an application. There are about 65 functions in this class.

High-level floating-point accurately rounding arithmetic functions (mpfr).
Omitted from GMP 4.0 due to delays with the paperwork, but will reappear in
the next release. See the mpfr site for the latest downloadable version.

Low-level positive-integer, hard-to-use, very low overhead functions are
found in the mpn class. No memory management is performed; the caller must
ensure enough space is available for the results. The set of functions is
not regular, nor is the calling interface. These functions accept input
arguments in the form of pairs consisting of a pointer to the least
significant word, and an integral size telling how many limbs (= words)
there are in that argument. (end of copy from your WEB-page)

----------------------------------------------------------------------------
----

I have successfully downloaded and installed gmp-4.0 and mpfr-2001 folders
(directories) only, whereas all of both includes many sub-folders. I don't
know, whether a first two library-series, so-called (mpz) and (mpq) in first
two parts this text, are included in successfully downloaded *.zip modules.
If yes, where can I find the corresponding documentation, at my SW equipment
as files *.htm[l], *.doc or *.pdf only ? At this time I can't to read or to
display the file-types as *.ps and LaTex text-formats.

Thank you very much for the understanding of my subjective problems. I am
tried to do proof, that number of so-called primes-twins is infinite.
Experimentally founded asymptotic function in range 1..32767*65536 implies,
that answer for this problem is YES.

address@hidden





---
Odchozí zpráva neobsahuje viry.
Zkontrolováno antivirovým systémem AVG (http://www.grisoft.cz).
Verze: 6.0.310 / Virová báze: 171 - datum vydání: 19.12.2001