Aclass is listing things that come in fives. some of the things on the list are: points on a star, players on a basketball team, sides on a pentagon. jan is writing a problem to match six times five. jan writes, "i have six nickels. each nickel is worth five cents. how much money do i have? " jan tells the class that she can represent how to solve the problem in many different ways. what are two different ways that jan could represent and solve her problem?

45

step-by-step explanation:

idk

step-by-step explanation:

the correct answer option is (2x-3)(2x+3).

step-by-step explanation:

we are given the following expression and we are to factorize it:

we are to find such factors that when multiplied they give a result of 36 (9 x 4 = 36) and when added they give a result of 0.

the two such factors of 36 are negative six and postive six.

factorizing the given expression to get:

therefore, the correct factorization of is (2x-3)(2x+3).

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.