Polygons: Calculating the Number of Diagonals

Поделиться
HTML-код
  • Опубликовано: 29 окт 2024

Комментарии • 24

  • @stcac1575
    @stcac1575 7 лет назад +8

    You explained it so well...thank you!

  • @asiangal9262
    @asiangal9262 4 года назад +4

    Hi may i know the formula for finding the no. Of triangles formed by diagonals in a polygon

  • @luispanameno1594
    @luispanameno1594 5 лет назад +2

    dang you came in clutch I smashed that like button

    • @FerranteMath
      @FerranteMath  5 лет назад +1

      Thanks Luis. Glad it helped you out

  • @dimasgomez
    @dimasgomez 6 лет назад +2

    We take the n number of vertices times the possible diagonals (n-3), then consider just the ones that are not duplicated. This gives us [n(n-3)]*1/2
    For a ABCDEF hexagram, we have (repeated diagonals are in parentheses):
    AC AD AE
    BD BE BF
    CE CF (CA)
    DF (DA) (DB)
    (EA) (EB) (EC)
    (FB) (FC) (FD)

  • @franathananimatedstudios2799
    @franathananimatedstudios2799 6 лет назад +4

    heres a trick
    triangle=0+2=quadrilateral+3=pentagon+4=hexagon+5=heptagon+6=octagon+7=nonagon+8=decagon

  • @jesliesaron3152
    @jesliesaron3152 3 года назад +1

    Thank you

  • @calli2463
    @calli2463 3 года назад +1

    Thankyou 💗

  • @wiseoldglitchakajuju3334
    @wiseoldglitchakajuju3334 3 года назад

    Can you explain exactly how the formula works?

    • @FerranteMath
      @FerranteMath  2 года назад

      Hello Wise. Not sure what you mean ... a formula can be derived from other principals but that would be a difficult explanation ... and I'm not sure that is what you're asking?

  • @doaaameen7206
    @doaaameen7206 7 лет назад +1

    Thank you💙

  • @nehaagrawal8521
    @nehaagrawal8521 2 года назад

    Thank, that really helped me. X_X

  • @Rachaelsofoluwe
    @Rachaelsofoluwe 4 года назад +1

    Thanks

  • @lizph3991
    @lizph3991 7 лет назад +2

    why do we need to subtract 3? why 3? 😁 thank you

    • @FerranteMath
      @FerranteMath  7 лет назад +2

      hi liz, good question. The pattern for the formula is n(n-3) all divided by 2. The - 3 comes from the pattern where n = the number of sides and the - 3 is the number of diagonals that cam come from any one vertex depending on the number of sides in the polygon. For example, a four-sided figure (n = 4) can only have one diagonal from any vertex ( n - 3) which equals one. Try it your self. Draw a 5 or 6 sided figure and count how many diagonals can be drawn from only one vertex. You will always see an n - 3 pattern.

    • @OMARRABIE7
      @OMARRABIE7 4 года назад +1

      And also if you have a exam it will bring you the formula but the formula he choosed is 3 but if you are explaining you can say another formulated

  • @anjalikatyal5610
    @anjalikatyal5610 7 лет назад +1

    there are 3 diagonals in a triangle.....we need to draw a vertex in the centre

    • @FerranteMath
      @FerranteMath  7 лет назад +2

      Hello Anjali . . . not sure what you're saying? There are no diagonals in a triangle.