Divisibility Rules and Polygon Combinatorics

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/15

flashcard set

Earn XP

Description and Tags

Flashcards covering divisibility rules for integers and combinatorial formulas for triangles and diagonals formed by the vertices of an n-sided polygon.

16 Terms

1
New cards

Divisibility Rule for 2

A number is divisible by 2 if its last digit is an even number.

2
New cards

Divisibility Rule for 3

A number is divisible by 3 if the sum of its digits is divisible by 3.

3
New cards

Divisibility Rule for 4

A number is divisible by 4 if its last two digits form a number divisible by 4.

4
New cards

Divisibility Rule for 5

A number is divisible by 5 if the last digit of the number is 0 or 5.

5
New cards

Divisibility Rule for 6

A number is divisible by 6 if the number is divisible by both 2 and 3.

6
New cards

Divisibility Rule for 7

Double the units place digit and subtract it from the rest of the number to check if the result is divisible by 7.

7
New cards

Divisibility Rule for 8

A number is divisible by 8 if its last three digits form a number divisible by 8.

8
New cards

Divisibility Rule for 9

A number is divisible by 9 if the sum of its digits is divisible by 9.

9
New cards

Divisibility Rule for 10

A number is divisible by 10 if the last digit of the number is 0.

10
New cards

Divisibility Rule for 11

A number is divisible by 11 if the difference between the sum of digits at even places and odd places is divisible by 11.

11
New cards

Divisibility Rule for 25

A number is divisible by 25 if its last two digits are divisible by 25 (such as 00, 25, 50, or 75).

12
New cards

Number of Diagonals in an nn-Sided Polygon

The total number of diagonals formed in a polygon with nn sides (or vertices), given by (n2)−n\binom{n}{2} - n.

13
New cards

Triangles Having One Side Common with an nn-Sided Polygon

The number of triangles formed by joining vertices of an nn-sided polygon that share exactly one side with the polygon, given by n(n−4)n(n - 4).

14
New cards

Triangles Having Two Sides Common with an nn-Sided Polygon

The number of triangles formed by joining vertices of an nn-sided polygon that share two sides with the polygon, given by nn.

15
New cards

Triangles Having No Side Common with an nn-Sided Polygon

The number of triangles formed by joining vertices of an nn-sided polygon that share no sides with the polygon, given by (n3)−(n+n(n−4))\binom{n}{3} - (n + n(n - 4)).

16
New cards

Total Triangles Formed by Vertices of an nn-Sided Polygon (PnP_n)

The total number of triangles formed by selecting any 3 vertices of an nn-sided regular polygon, given by Pn=(n3)P_n = \binom{n}{3}.