/usr/share/common-lisp/source/rsm-mod/package.lisp is in cl-rsm-mod 1.4.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 | ;;;; -*- Mode: LISP; Syntax: ANSI-Common-Lisp; Base: 10 -*-
;;;; *************************************************************************
;;;; FILE IDENTIFICATION
;;;;
;;;; Name: package.lisp
;;;; Purpose: Package definition for Modular arithmetic.
;;;; Author: R. Scott McIntire
;;;; Date Started: Aug 2003
;;;;
;;;; $Id: package.lisp,v 1.4 2003/10/03 02:21:53 rscottmcintire Exp $
;;;; *************************************************************************
(in-package #:cl-user)
(defpackage rsm.mod
(:use #:cl)
(:shadow #:+ #:* #:^)
(:documentation
"This package supports modular arithmetic.
Export Summary:
+: Add numbers over Z mod n.
*: Multiply numbers over Z mod n.
^: Exponentiate over Z mod n.
euler-phi: Return the Euler phi function of a number.
factors : Return the factors of a number.
gcd-with-pair: Gets the gcd of two numbers a and b returning also
the integer pair, (r s), such that r*a + s*b = gcd(a,b).
has-inverse-p: Does a number have in inverse in Z mod n?
inverse : Find the inverse (if it exists) in Z mod n.
ppow : Exponentiate over Z mod p where p is prime.
rational-approx: Returns a simple rational approximation
within a given tolerance.
solve-congruence-system: Solve for x: x = a_i mod m_i; i in [1,N]
")
(:export
#:+
#:*
#:^
#:euler-phi
#:factors
#:gcd-with-pair
#:has-inverse-p
#:inverse
#:ppow
#:rational-approx
#:solve-congruence-system))
|