PrintForm
Definitions
finite
sets
Sections
AutomataTheory
Doc
At:
rect
enumer
1
3
1
2
1
1
1
2
1
1
1.
n:
2.
m:
3.
b:
4.
0
b < n
m
5.
b = (b
m)
m+(b rem m)
(b
m) < n
By:
Analyze 4
Generated subgoal:
1
4.
0
b
5.
b < n
m
6.
b = (b
m)
m+(b rem m)
(b
m) < n
About:
b
m
m)m+(b rem m)
(b m) < n
b < nm m)m+(b rem m) (b m) < nbm m)m+(b rem m) (b m) < n
