|
|
1.1 root 1: .TH ARITHMETIC 6
2: .CT 1 inst_info
3: .SH NAME
4: arithmetic \- drill in number facts
5: .SH SYNOPSIS
6: .B /usr/games/arithmetic
7: [
8: .B +-x/
9: ]
10: [
11: .I range
12: ]
13: .SH DESCRIPTION
14: .I Arithmetic
15: types out simple arithmetic problems,
16: and waits for an answer to be typed in.
17: If the answer is correct,
18: it types back
19: .LR Right! ,
20: and a new problem.
21: If the answer is wrong,
22: it replies
23: .L What? ,
24: and waits for another answer.
25: Every twenty problems, it publishes
26: statistics on correctness and the time required
27: to answer.
28: .PP
29: To quit the program,
30: type an interrupt (delete).
31: .PP
32: The first optional argument determines the kind of problem
33: to be generated;
34: .B +-x/
35: get
36: addition, subtraction, multiplication, and division
37: problems respectively.
38: One or more characters can be given;
39: if more than one is given, the different types of
40: problems will be mixed in random order; default is
41: .B +-
42: .PP
43: .I Range
44: is a decimal number;
45: all addends, subtrahends, differences, multiplicands, divisors,
46: and quotients will be less than or equal to the value of
47: .IR range .
48: Default
49: .I range
50: is 10.
51: .PP
52: At the start, all numbers less than or equal to
53: .I range
54: are equally likely
55: to appear.
56: If the respondent makes a mistake,
57: the numbers in the problem which was missed
58: become more likely to reappear.
59: .PP
60: As a matter of educational philosophy, the program will
61: not give correct answers,
62: since the learner should, in principle,
63: be able to calculate them.
64: Thus the program is intended to provide drill for
65: someone just past the first learning stage,
66: not to teach number facts
67: .I de
68: .IR novo .
69: For almost all users,
70: the relevant statistic should be
71: time per problem, not percent correct.
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.