We are given a triangle ABC and a set of points on its sides: 4 points on side AB, 5 points on side BC, and 4 points on side AC. A total of $4 + 5 + 4 = 13$ points are available. We need to find the total number of distinct pentagons (polygons with 5 vertices) that can be formed by choosing vertices exclusively from these 13 points.
To form a non-degenerate pentagon, the 5 chosen vertices cannot have 3 or more points lying on the same straight line. Since the points are located on the sides of the triangle ABC, the only possible collinear sets of 3 or more points are those that lie entirely on one side (AB, BC, or AC).
Therefore, a valid pentagon can only be formed if, out of the 5 chosen vertices, at most 2 vertices come from any single side of the triangle ABC.
Let $n_{AB}$, $n_{BC}$, and $n_{AC}$ be the number of vertices chosen from sides AB, BC, and AC, respectively. For a valid pentagon:
These conditions also respect the maximum number of points available on each side ($N_{AB}=4, N_{BC}=5, N_{AC}=4$).
We need to find combinations of $(n_{AB}, n_{BC}, n_{AC})$ that satisfy the conditions above. The only possible combinations summing to 5, with each value less than or equal to 2, are permutations of (2, 2, 1).
We use combinations, denoted as $C(n, k)$ or $\binom{n}{k}$, calculated as $\binom{n}{k} = \frac{n!}{k!(n-k)!}$.
The total number of possible pentagons is the sum of the ways calculated for each valid case:
Total Pentagons = Case 1 + Case 2 + Case 3
Total Pentagons = $240 + 180 + 240 = 660$.
Let f and g be functions satisfying $f(x+y) = f(x)f(y), f(1) = 7$ and $g(x+y) = g(xy), g(1) = 1$, for all $x, y \in \mathbb{N}$. If $\sum_{x=1}^{n} \left(\frac{f(x)}{g(x)}\right) = 19607$, then n is equal to :