blob: 0b88e78faac51c852f04432729b689d6519363d9 (
plain)
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
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
|
#lang racket
(require "../../shared/data-directed-programming.rkt")
(require "./83/install.rkt")
;; arithmetic package
(define get-put-apply (install-arithmetic-package))
(define get (car get-put-apply))
(define put (cadr get-put-apply))
(define apply-fn (caddr get-put-apply))
;; something
(define p1 (make-polynomial 'x (sparse-termlist
(term 2 1) (term 0 1))))
(define p2 (make-polynomial 'x (sparse-termlist
(term 3 1) (term 0 1))))
(define rf (make-rat p2 p1))
((lambda ()
(newline)
(newline)
(newline)
(newline)
(display (list "RESULT --" rf))
(newline)
(newline)
(display (list "RESULT --" (add rf rf)))
(newline)
(newline)
(define test-p1 (make-polynomial 'x
(sparse-termlist
(term 4 1)
(term 3 -1)
(term 2 -2)
(term 1 2))))
(define test-p2 (make-polynomial 'x
(sparse-termlist
(term 3 1)
(term 1 -1))))
(display (list "RESULT GCD --" (greatest-common-divisor test-p1 test-p2)))))
;; 95
;; I represented reals as inexact decimals so our gcd breaks down here
;; Even more, I didn't bother with inexact gcd and the real gcd just returns the dividend
((lambda ()
(define p1 (make-polynomial 'x
(sparse-termlist
(term 2 1) (term 1 -2) (term 0 1))))
(define p2 (make-polynomial 'x
(sparse-termlist
(term 2 11) (term 0 7))))
(define p3 (make-polynomial 'x
(sparse-termlist
(term 1 13) (term 0 5))))
(define q1 (mul p1 p2))
(define q2 (mul p1 p3))
(newline)
(display q1)
(newline)
(display q2)
(newline)
(newline)
(newline)
(newline)
(newline)
(display (list "GREATEST-COMMON-DIVISOR" (greatest-common-divisor q1 q2)))))
;; 96
;; integerizing factor is the c^{1+order of P-order of Q}
;; division by first multiplying the dividend by this constant is called pseudo division
;; 97
(define (reduce n d)
(apply-fn 'reduce n d))
((lambda ()
(define p1 (make-polynomial 'x
(sparse-termlist
(term 1 6)
(term 0 1))))
(define p2 (make-polynomial 'x
(sparse-termlist
(term 1 6))))
(newline)
(display (list "REDUCE call"))
(newline)
(display (list "REDUCE result --" (reduce p1 p2)))
(newline)
(display (list "REDUCE integer result --" (reduce 6 6)))
(newline)
(display (list "REDUCE real result --" (reduce 12.0 8.0)))))
((lambda ()
(newline)
(display (list "TEST-CASE-FROM 97"))
(define p1 (make-polynomial 'x (sparse-termlist (term 1 1) (term 0 1))))
(define p2 (make-polynomial 'x (sparse-termlist (term 3 1) (term 0 -1))))
(define p3 (make-polynomial 'x (sparse-termlist (term 1 1))))
(define p4 (make-polynomial 'x (sparse-termlist (term 2 1) (term 0 -1))))
(define rf1 (make-rat p1 p2))
(define rf2 (make-rat p3 p4))
(newline)
(display (list "RESULT TEST-CASE 97" (add rf1 rf2)))))
|
