2x + 2

=

-3 + x

a)

2x + 2

-3 + x

x

=

b)

x

5 - 2x

x

x

5 - 2x

=

c)

x + 3

x + 2

=

d)

-3

4x - 3

x + 3

x + 2

-3

4x - 3

x

n = 4 (slider from 1 to 5, step 1)
a = false
b = false
f(x) = (2 * x) + 2
g(x) = -3 + x
A = Intersect(f, g, 1)
c = Line(A, yAxis)
B = Intersect(c, xAxis)
d = Segment(A, B)
a_1 = false
b_1 = false
h(x) = x
p(x) = 5 - (2 * x)
C = Intersect(h, p, 1)
e = Line(C, yAxis)
D = Intersect(e, xAxis)
i = Segment(D, C)
a_2 = false
b_2 = false
a_3 = false
b_3 = false
q(x) = x + 3
r(x) = x + 2
s(x) = (4 * x) - 3
E = Intersect(s, j, 1)
F = Intersect(xAxis, yAxis)
k = Segment(F, E)
G = (15, 11)
H = Point(Circle[G, 12])
I: G + Vector[G, H] - OrthogonalVector[Segment[G, H]]
J: G + (0 * Vector[G, H]) - OrthogonalVector[Segment[G, H]]
poly1, g_1, h_1, i_1, j_1 = Polygon(G, H, I, J)