Solutions

User
Exercise
Author Exercise Date
Profile image Artem 2.35 Count-leaves as an accumulation 2025-06-14 13:25:08 Show
Profile image Artem 2.34 Horner's rule 2025-06-14 13:16:00 Show
Profile image Artem 2.33 List-manipulation operations as accumulations 2025-06-14 12:47:44 Show
Profile image Artem 2.32 The set of all subsets 2025-06-14 11:59:28 Show
Profile image Artem 2.31 Tree map 2025-06-14 11:38:37 Show
Profile image Artem 2.30 A tree of the squares 2025-06-14 11:28:16 Show
Profile image Artem 2.29 Binary mobile 2025-06-14 11:22:12 Show
Profile image Artem 2.28 List of tree leaves 2025-06-14 10:06:54 Show
Profile image Artem 2.27 Deep reverse 2025-06-14 09:49:42 Show
Profile image Artem 2.23 The procedure for-each 2025-06-14 09:07:04 Show
Profile image Artem 2.21 A list of the squares 2025-06-14 08:46:10 Show
Profile image Artem 2.20 Dotted-tail notation 2025-06-14 03:17:31 Show
Profile image Artem 2.19 Change coins of different currencies 2025-06-14 02:11:18 Show
Profile image Artem 2.18 Reverse 2025-06-13 15:12:03 Show
Profile image Artem 2.17 Last element of list 2025-06-13 14:49:38 Show
Profile image Artem 2.12 Interval produced by center and percentage tolerance 2025-06-12 11:36:21 Show
Profile image Artem 2.11 The signs of the endpoints of the intervals 2025-06-12 11:14:02 Show
Profile image Artem 2.10 Interval that spans zero 2025-06-12 10:56:07 Show
Profile image Artem 2.9 The width of an interval 2025-06-12 10:12:03 Show
Profile image Artem 2.8 Subtraction of intervals 2025-06-12 09:52:12 Show
Profile image Artem 2.7 Upper and lower bounds of interval 2025-06-12 09:37:44 Show
Profile image Artem 2.6 Church numerals 2025-06-12 09:14:29 Show
Profile image Artem 2.5 Representation of pairs using only numbers and arithmetic operations 2025-06-11 16:37:12 Show
Profile image Artem 2.4 Procedural representation of pairs 2025-06-11 16:10:45 Show
Profile image Artem 2.3 Representation of rectangles on a plane 2025-06-11 06:37:37 Show
Profile image Artem 2.2 Representation of line segments on the plane. 2025-06-11 05:58:16 Show
Profile image Artem 2.1 Modify the make-rat 2025-06-11 05:25:25 Show
Profile image Федоров Николай 1.4 Composite expressions 2025-06-08 20:27:25 Show
Profile image Федоров Николай 1.3 Sum of the squares 2025-06-08 20:25:58 Show
Profile image Федоров Николай 1.2 Into prefix form 2025-06-08 18:59:34 Show
Profile image Федоров Николай 1.1 Sequence of expressions 2025-06-08 15:22:09 Show
Profile image Artem 1.46 Iterative improvement 2025-06-08 11:46:17 Show
Profile image Artem 1.45 Computing nth roots 2025-06-08 11:06:29 Show
Profile image Artem 1.44 N-fold smoothed function 2025-06-08 10:27:10 Show
Profile image Artem 1.43 Nth repeated application of f 2025-06-08 10:14:20 Show
Profile image Artem 1.42 Composition 2025-06-08 09:57:11 Show
Profile image Artem 1.41 Double 2025-06-08 09:54:19 Show
Profile image Artem 1.40 Approximate zeros 2025-06-08 09:51:58 Show
Profile image Artem 1.39 Lambert's formula 2025-06-08 09:01:15 Show
Profile image Artem 1.38 Euler's expansion 2025-06-08 08:32:57 Show
Profile image Artem 1.34 Evaluate the combination 2025-06-08 06:54:09 Show
Profile image Artem 1.33 General accumulation 2025-06-05 05:46:28 Show
Profile image Artem 1.32 Accumulation 2025-06-05 05:23:25 Show
Profile image Artem 1.31 Higher-order procedures 2025-06-05 04:58:27 Show
Profile image Artem 1.30 Iteration 2025-06-04 18:14:57 Show
Profile image Artem 1.29 Simpson's Rule 2025-06-04 17:54:27 Show
Profile image Do_Be_Da_Bu 3.16 The procedure to count the number of pairs 2025-06-02 19:30:00 Show
Profile image Do_Be_Da_Bu 3.15 Box-and-pointer diagrams 2025-06-02 17:58:15 Show
Profile image Do_Be_Da_Bu 3.14 Mystery procedure 2025-06-02 16:46:11 Show
Profile image Do_Be_Da_Bu 3.13 Make-cycle procedure 2025-06-02 16:30:47 Show