Baum

Radius Kreisstraße

Leinenlänge

Pascal'sche Schnecken

Q ziehen

refresh: Strg f

a = 2.3 (slider from -5 to 5, step 0.1)
k = 1.6 (slider from -5 to 5)
pascal: (x^(2) + y^(2) - ((2 * a) * x))^(2) = (k^(2) * (x^(2) + y^(2)))
A, B, C = Intersect(pascal, yAxis)
kreisstrasse: (x - a)^(2) + y^(2) = a^(2)
Q = Point(kreisstrasse)
i = Line(B, Q)
leine = Circle(Q, k)
P_1, P_2 = Intersect(leine, i)
r = Segment(B, P_2)
f = Segment(Q, P_1)
g = Segment(Q, P_2)
Ortslinie1 = Locus(P_1, Q)
Ortslinie2 = Locus(P_2, Q)
D = (-3.57160979233467, -1.3735508847228823)
E = (-2.3916781471911146, -1.3735508847228823)