Ashley wants to prove that circle C with center (1,6) and radius 5 is similar to circle D with center (-2, 2) and radius 4. She plans to do so by mapping C onto D using a sequence of similarity transformations. Which sequence should she use? translation 3 units left and 4 units up, then dilation with center (-2, 2) and scale factor 54.

translation 3 units right and 4 units up, then dilation with center (-2, 2) and scale factor 45.

translation 3 units left and 4 units down, then dilation with center (-2,2) and scale factor 45.

translation 3 units right and 4 units down, then dilation with center (-2, 2) and scale factor 54.

Ashton wants to prove that circle C with center (-4, 8) and radius 12 is similar to circle D with center (4, -8) and radius 8. He plans to do so by mapping C onto D using a sequence of similarity transformations. Which sequence should he use?

translation 8 units right and 16 units up, then dilation with center (-4,8) and scale factor 23.

translation 8 units left and 16 units up, then dilation with center (-4, 8) and scale factor 32.

translation 8 units left and 16 units down, then dilation with center (4, -8) and scale factor 32.

translation 8 units right and 16 units down, then dilation with center (4, -8) and scale factor 23.

3. Asher wants to show that circle C with a radius of 8 is similar to circle D whose radius is 6 by transforming C into D using a similarity transformation. He plans to use a dilation with center (0, 0) and scale factor k. What value of k should Asher use?

A. 3/4

B. 4/3

C. 9/16

D. 16/9

by definition, an arc subtended by a central angle of some given measure has the same measure. so .

answer: b

step-by-step explanation: im sorry bro bro but thats not a eqation the human mind can answer and plus im a devil

i think it's eleven too, don't woosh me here, but according to the "experts" it's 2.

the proof starts from the peano postulates, which define the natural

numbers n. n is the smallest set satisfying these postulates:

  p1.   1 is in n.

  p2.   if x is in n, then its "successor" x' is in n.

  p3.   there is no x such that x' = 1.

  p4.   if x isn't 1, then there is a y in n such that y' = x.

  p5.   if s is a subset of n, 1 is in s, and the implication

      (x in s => x' in s) holds, then s = n.

then you have to define addition recursively:

  def: let a and b be in n. if b = 1, then define a + b = a'

      (using p1 and p2). if b isn't 1, then let c' = b, with c in n

      (using p4), and define a + b = (a + c)'.

then you have to define 2:

  def:   2 = 1'

2 is in n by p1, p2, and the definition of 2.

theorem:   1 + 1 = 2

proof: use the first part of the definition of + with a = b = 1.

      then 1 + 1 = 1' = 2   q.e.d.

note: there is an alternate formulation of the peano postulates which

replaces 1 with 0 in p1, p3, p4, and p5. then you have to change the

definition of addition to this:

  def: let a and b be in n. if b = 0, then define a + b = a.

      if b isn't 0, then let c' = b, with c in n, and define

      a + b = (a + c)'.

you also have to define 1 = 0', and 2 = 1'. then the proof of the

theorem above is a little different:

proof: use the second part of the definition of + first:

      1 + 1 = (1 + 0)'

      now use the first part of the definition of + on the sum in

      parentheses:   1 + 1 = (1)' = 1' = 2   q.e.d.

i think it would be c

mark brainliest if im right

step-by-step explanation: