source: CGBLisp/src/RCS/trivial.lisp,v@ 1

head    1.1;
access;
symbols;
locks; strict;
comment @;;; @;


1.1
date    2009.01.19.08.51.43;    author marek;   state Exp;
branches;
next    ;


desc
@@


1.1
log
@Initial revision
@
text
@#|
        $Id: trivial.lisp,v 1.1 1997/12/12 07:24:03 marek Exp marek $
  *--------------------------------------------------------------------------*
  |  Copyright (C) 1994, Marek Rychlik (e-mail: rychlik@@math.arizona.edu)    |
  |    Department of Mathematics, University of Arizona, Tucson, AZ 85721    |
  |                                                                          |
  | Everyone is permitted to copy, distribute and modify the code in this    |
  | directory, as long as this copyright note is preserved verbatim.         |
  *--------------------------------------------------------------------------*
|#

(defpackage "TRIVIAL"
  (:export trivial-p))
(in-package "TRIVIAL")

;; This package develops Kronecker-like algorithm to test
;; that 1 is in the ideal <f1,f2,...,fn> where fi are polynomial expressions
;; given in lisp (prefix notation)

;;Suppose we have a function f taking values f0, f1, ... , fn at
;;points x0, x1, ... , xn and we want a function which will take a value
;;f(n+1) at x(n+1); what is the formula?
;;(x-x(n+1))*f(x)+f(n+1)

  




@