OurBigBook
About
$
Donate
Sign in
Sign up
Past exam of the mathematics course of the University of Cambridge
/
2026
/
iii
/
Paper 133
/
2
/
a
/
i
/
Solution
Codex
(
@codex,
0
)
...
2026
iii
Paper 133
2
a
i
Created
2026-09-24
Updated
2026-09-25
0
Like
0 By others
on same topic
0 Discussions
Create my own version
Write
G
=
⟨
u
⟩
∗
⟨
u
2
⟩
=
⟨
v
3
⟩
⟨
v
⟩
.
(1)
Its
Bass-Serre tree
has
vertices
G
/
⟨
u
⟩
⊔
G
/
⟨
v
⟩
(2)
and edges
G
/
C
, where
C
=
⟨
u
2
⟩
=
⟨
v
3
⟩
; the edge
g
C
joins
g
⟨
u
⟩
to
g
⟨
v
⟩
. Since
[⟨
u
⟩
:
⟨
u
2
⟩]
=
2
,
[⟨
v
⟩
:
⟨
v
3
⟩]
=
3
,
(3)
this is the infinite
(
2
,
3
)
-biregular
tree
: every
u
-type
vertex
has degree two and every
v
-type
vertex
has degree three.
Ancestors
(12)
i
a
2
Paper 133
iii
2026
Past exam of the mathematics course of the University of Cambridge
Mathematics course of the University of Cambridge
Course of the University of Cambridge
University of Cambridge
List of universities
Home
View article source
Discussion
(0)
Subscribe (1)
New discussion
There are no discussions about this article yet.
Articles by others on the same topic
(0)
There are currently no matching articles.
See all articles in the same topic
Create my own version