-
Notifications
You must be signed in to change notification settings - Fork 0
/
fractions_calculator.rkt
455 lines (343 loc) · 11 KB
/
fractions_calculator.rkt
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
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
#lang racket/base
(require racket/list)
(require racket/format)
(require dyoo-while-loop)
#(require br/verbose-app)
; GCD FUNCTION TO REDUCE FRACTION TO LOWEST FORM
(define (gcd a b )
(if ( = b 0)
a
(gcd b (remainder a b))))
#|========== PROPER/IMPROPER FRACTIONS ==========|#
; TO CREATE PROPER/IMPROPER FRACTION
(define ( proper_improper numer denom )
(cons (/ numer (gcd numer denom)) ( / denom (gcd numer denom)))
)
; SELECTORS TO RETURN NUM AND DENOM SEPARATELY
(define (numer x)
(car x )
)
(define (denom x)
(cdr x)
)
; PRINT PROPER/IMPROPER FRACTION
(define (print-fraction x)
;(newline)
(display (numer x))
(display "/")
(display (denom x))
)
#|=====================================|#
#|========== MIXED FRACTIONS ==========|#
;
(define ( make-mixed-fraction whole-part numer denom )
(cons whole-part (cons numer denom))
)
;SELECTORS TO RETURN NUM, DENOM AND WHOLEPART SEPARATELY
(define (numer-mixed x)
(cadr x)
)
(define (denom-mixed x)
(cddr x)
)
(define (wholepart-mixed x)
(car x)
)
; PRINT MIXED FRACTION
(define (print-mixedfraction x)
;(newline)
(display (wholepart-mixed x))
(display " ")
(display (numer-mixed x))
(display "/")
(display (denom-mixed x))
)
#|====================================|#
#|====================================|#
;COMPLEX FRACTIONS
(define ( make-complex-fraction numer denom )
(cons numer denom)
)
(define (numer-complex-fraction x)
(car x)
)
(define (denom-complex-fraction x)
(cdr x)
)
;DISPLAY COMPLEX FRACTION
(define ( print-complexfraction x)
(newline)
(display "Complex fraction: ")
(if (is_mixed_frac (numer-complex-fraction x))
(print-mixedfraction (numer-complex-fraction x))
(print-fraction (numer-complex-fraction x))
)
(display " / ")
(if (is_mixed_frac (denom-complex-fraction x))
(print-mixedfraction (denom-complex-fraction x))
(print-fraction (denom-complex-fraction x))
)
)
; Check if complex fraction - returns true if complex fraction else no
(define (is_complex_frac x)
(if(pair? (car x))
#t
#f
)
)
; X - FRACTION(Proper-Improper or Mixed)
; P - power to be raised -> can be integral or fractional
(define (power-of-fraction x p)
(newline)
(display "Power fraction: ")
; if the denominator of the power is 1 i.e the power is integral
(if( = (denom p) 1)
; True: make a list containing the fraction x p times
; multiply contents of the list to get the power fraction
(print-fraction (mul-list (convert-list-pro-impro(make-list (numer p) x))))
; False: power to be raised is a fraction of form m/n
; so (a/b)^(m/n) -> nthroot(a^m)/nthroot(b^m)
(print-fraction
(divide
(proper_improper (string->number (~r (*(string->number (~r (expt (numer (mul-list (convert-list-pro-impro(make-list (numer p) x)))) (/ 1 (denom p))) #:precision 2) )100) #:precision 0)) 100)
(proper_improper (string->number (~r (*(string->number (~r (expt (denom (mul-list (convert-list-pro-impro(make-list (numer p) x)))) (/ 1 (denom p))) #:precision 2) )100) #:precision 0)) 100)
)
)
)
)
;FUNCTIONS
; CHECK IF THE VALUE IS MIXED FRACTION OR NOT
(define (is_mixed_frac x)
(if(pair? (cdr x))
#t
#f
)
)
; CONVERTING MIXED TO IMPROPER FRACTION
(define ( convert-mixed-to-frac x )
(proper_improper (+ (* (wholepart-mixed x) (denom-mixed x)) (numer-mixed x)) (denom-mixed x))
)
; CONVERTING IMPROPER TO MIXED FRACTION
(define ( convert-frac-to-mixed x)
(make-mixed-fraction (quotient (numer x) (denom x)) (remainder (numer x) (denom x)) (denom x))
)
;EQUALITY BETWEEN TWO FRACTIONS
(define (equality x y)
(and (= (numer x) (numer y) ) (= (denom x) (denom y)) )
)
;INVERT A FRACTION
(define (invert x)
(proper_improper (denom x) (numer x))
(print-fraction (proper_improper (denom x) (numer x)))
)
;TO ADD TWO FRACTIONS
(define (addition x y )
( proper_improper ( + (*(numer x)(denom y)) (*(numer y)(denom x))) (*(denom x)(denom y)) )
)
;TO MULTIPLY TWO FRACTIONS
(define (multiplication x y )
( proper_improper (*(numer x)(numer y)) (*(denom x)(denom y)) )
)
;TO SUBTRACT TWO FRACTIONS
(define (subtraction x y )
( proper_improper ( - (*(numer x)(denom y)) (*(numer y)(denom x))) (*(denom x)(denom y)) )
)
;TO DIVIDE TWO FRACTIONS
(define (divide x y )
( proper_improper (*(numer x)(denom y)) (*(denom x)(numer y)) )
)
;checking version 4
; Function to check mixed fraction - If mixed convert it into improper fraction else improper fraction
(define (check-mixed-frac-to-improper x)
(if(is_mixed_frac x)
(convert-mixed-to-frac x)
x
)
)
; Function to check all values in list and then change to improper fraction and then store it in new list
; li - original list containing mixed fractions, improper and proper fractions
; new_li - new list containing fractions in proper/improper format
(define (conv-list-pro-impro li new_li)
(if(= (length li ) 0)
new_li
(conv-list-pro-impro (cdr li) (append new_li (list (check-mixed-frac-to-improper (car li)) ))
)
)
)
(define (convert-list-pro-impro li)
(conv-list-pro-impro li (list))
)
; newww
;convert complex into proper/improper fraction
(define (convert-complex-to-frac x)
(div-list (convert-list-pro-impro (list (car x) (cdr x))) )
)
; Function to check Complex fraction - If Complex convert it into improper fraction else improper fraction
(define (check-complex-frac-to-improper x)
(if(is_mixed_frac x)
(convert-complex-to-frac x)
x
)
)
; Function to check all values in list and then change to improper fraction and then store it in new list
; li - original list containing Complex,mixed fractions, improper and proper fractions
; new_li - new list containing fractions in proper/improper format
(define (conv-complex-frac-to-pro-impro li new_list)
(if(= (length li ) 0)
new_list
(let (
(element (car li))
(list-wo-1st-fraction (cdr li))
)
(if (is_complex_frac element)
(conv-complex-frac-to-pro-impro list-wo-1st-fraction (append new_list (list (check-complex-frac-to-improper element) )) )
(conv-complex-frac-to-pro-impro
list-wo-1st-fraction
(append new_list (
(lambda (x)
(if(is_mixed_frac x)
(list(convert-mixed-to-frac x))
(list x)
)
) element
)
)
)
)
)
)
)
(define (convert-complex-list-pro-impro li)
(conv-complex-frac-to-pro-impro li (list))
)
;PROCEDURAL ABSTRACTION - TERM(ADD,SUB,MUL,DIV) ---- new
(define (arithmetic-operations term n sum)
(if(= (length n) 0)
sum
(arithmetic-operations term (cdr n) (term sum (car n))
)
)
)
;FUNCTION TO ADD A LIST OF NUMBERS - TAKES ONE PARAMETER N(LIST OF NUMBERS) ----- new
(define (add-list n)
(arithmetic-operations addition (convert-complex-list-pro-impro n) (proper_improper 0 1))
)
;FUNCTION TO MULTIPLY A LIST OF NUMBERS - TAKES ONE PARAMETER N(LIST OF NUMBERS)---new
(define (mul-list n)
(if (= (length n) 0)
(proper_improper 0 1)
(arithmetic-operations multiplication (convert-complex-list-pro-impro n) (proper_improper 1 1))
)
)
(define (tot_div_sub func term n)
(if(= (length n) 1)
(car n)
(func term (cdr n) (car n))
)
)
(define (sub-list n)
(if (= (length n) 0)
(display "Error - Enter atleast one element")
(tot_div_sub arithmetic-operations subtraction (convert-complex-list-pro-impro n))
)
)
(define (div-list n)
(if (= (length n) 0)
(display "Error - Enter atleast one element")
(tot_div_sub arithmetic-operations divide (convert-complex-list-pro-impro n)))
)
(define (print-arithmetic-ops x li )
(print-fraction (x li))
)
;sample variables
(define (start a)
(cond
((= a 1)
(display "1 :To enter proper/improper fraction \n")
(display "2 :To enter mixed fraction \n")
(display "3 :To make complex fraction\n")
(let((choice(read)))
(cond
((= choice 1)
(while (not (string=? (read-line)
"quit"))
(begin
(display "Enter proper/improper fractions\n")
(define p1 (proper_improper (read) (read)))
(define p2 (proper_improper (read) (read)))
)(display "Enter what operation need to be performed\n")
(let((check(read)))
(cond((eq? check 'addition)(display(addition p1 p2)))
((eq? check 'subtraction)( display (subtraction p1 p2)))
((eq? check 'multiplication)(display (multiplication p1 p2)))
((eq? check 'divide)(display (divide p1 p2)))
((eq? check 'frac-mixed)(display ( convert-frac-to-mixed p1) ))
((eq? check 'invert)(display (invert p1) ))
((eq? check 'equality)(display (equality p1 p2) ))
((eq? check 'power)(display (power-of-fraction p1 p2)))
(else error "unknown type"))
check)
(display "\n1-yes 0-no\n")
(display "Do you want to continue: \n")
(let((temp (read)))
(if (= temp 1)(continue)(break)))
(printf "quit? ")
)
)
((= choice 2)
(while (not (string=? (read-line)
"quit"))
(begin
(display "Enter mixed fractions\n")
(define m1 (make-mixed-fraction (read) (read) (read)))
(define m2 (make-mixed-fraction (read) (read) (read)))
)(display "Enter what operation need to be performed\n")
(let((check(read)))
(cond((eq? check 'mixed-improper)(display (check-mixed-frac-to-improper m1)))
((eq? check 'mixed-frac)( display ( convert-mixed-to-frac m2 )))
(else error "unknown type"))
check)
(display "\n1-yes 0-no\n")
(display "Do you want to continue: \n")
(let((temp (read)))
(if (= temp 1)(continue)(break)))
(printf "quit? ")
)
)
((= choice 3)
(while (not (string=? (read-line)
"quit"))
(begin
(display "Enter proper/improper and mixed\n")
(define p1 (proper_improper (read) (read)))
(define p2 (proper_improper (read) (read)))
(define m1 (make-mixed-fraction (read) (read) (read)))
(define m2 (make-mixed-fraction (read) (read) (read)))
)(display "Enter what operation need to be performed\n")
(let((check(read)))
(cond((eq? check 'make-complex)(display(make-complex-fraction m2 p2)))
(else error "unknown type"))
check)
(display "\n1-yes 0-no\n")
(display "Do you want to continue: \n")
(let((temp (read)))
(if (= temp 1)(continue)(break)))
(printf "quit? ")
)
)
)
)
)) )
;sample variables
(define gm1 (make-mixed-fraction 1 3 4))
(define gm2 (make-mixed-fraction 3 1 4))
(define gp1 (proper_improper 1 2))
(define gp2 (proper_improper 3 2))
(define gc1 (make-complex-fraction gm1 gp1))
(define gc2 (make-complex-fraction gp1 gm1))
(define gl1 (list gp1 gm1))
(define gl2 (list gp1 gm1 gm2 gp2))
(define gl3 (list gp1 gm1 gc1))
(define gel (list ))
(define gep1 (proper_improper 2 1))
(define gep2 (proper_improper 2 3))