We will assume that all the ages of the stuffed animals are natural numbers (i.e. cannot be 0). Removing this assumption makes the problem impossible.
Let $T=\{...\}$ be the set of ages of the stuffed animals, $P$ be their product, and $S$ be their sum.
Initially, Beth knows $S$, but not $P$. For some $S$, we need to find a value of $P$ and $|T|$ such that knowing these things does not uniquely identify the members of $T$. Moreover, we know that such a combination is unique for $S$; if it were not unique, then Beth would not be able to determine $P$ simply by knowing that she couldn't determine the values of $T$ knowing $P$ and $|T|$.
First Solution
Lets try some values for $S$. It turns out we need to go as high as
$S=12$
before we find a case of two sets of numbers with the same number of elements and the same product. These are;
$$T=\{1,3,4,4\} \implies P=48$$
$$T=\{2,2,2,6\} \implies P=48$$
Notice that they have the same sum, product, and number of elements. If Beth knows the product, sum, and number of elements, she still will not know the values.
However, does Beth knowing this help? Only if all other sets of numbers for the sum are uniquely defined. Well, here they are;
- $T=\{1,1,10\} \implies P=10$
- $T=\{1,2,9\} \implies P=18$
- $T=\{1,3,8\} \implies P=24$
- $T=\{1,4,7\} \implies P=28$
- $T=\{1,5,6\} \implies P=30$
- $T=\{2,2,8\} \implies P=32$
- $T=\{2,3,7\} \implies P=42$
- $T=\{2,4,6\} \implies P=48$
- $T=\{2,5,5\} \implies P=50$
- $T=\{3,3,6\} \implies P=54$
- $T=\{3,4,5\} \implies P=60$
- $T=\{4,4,4\} \implies P=64$
- $T=\{1,1,1,9\} \implies P=9$
- $T=\{1,1,2,8\} \implies P=16$
- $T=\{1,1,3,7\} \implies P=21$
- $T=\{1,1,4,6\} \implies P=24$
- $T=\{1,1,5,5\} \implies P=25$
- $T=\{1,2,2,7\} \implies P=28$
- $T=\{1,2,3,6\} \implies P=36$
- $T=\{1,2,4,5\} \implies P=40$
- $T=\{1,3,3,5\} \implies P=45$
- $T=\{1,3,4,4\} \implies P=48$ SAME!!
- $T=\{2,2,2,6\} \implies P=48$ SAME!!
- $T=\{2,2,3,5\} \implies P=60$
- $T=\{2,2,4,4\} \implies P=64$
- $T=\{2,3,3,4\} \implies P=72$
- $T=\{3,3,3,3\} \implies P=81$
- $T=\{1,1,1,1,8\} \implies P=8$
- $T=\{1,1,1,2,7\} \implies P=14$
- $T=\{1,1,1,3,6\} \implies P=18$
- $T=\{1,1,1,4,5\} \implies P=20$
- $T=\{1,1,2,2,6\} \implies P=24$
- $T=\{1,1,2,3,5\} \implies P=30$
- $T=\{1,1,2,4,4\} \implies P=32$
- $T=\{1,2,2,2,5\} \implies P=40$
- $T=\{1,2,2,3,4\} \implies P=48$
- $T=\{2,2,2,2,4\} \implies P=64$
- $T=\{2,2,2,3,3\} \implies P=72$
- $T=\{1,1,1,1,1,7\} \implies P=7$
- $T=\{1,1,1,1,2,6\} \implies P=12$
- $T=\{1,1,1,1,3,5\} \implies P=15$
- $T=\{1,1,1,1,4,4\} \implies P=16$
- $T=\{1,1,1,2,2,5\} \implies P=20$
- $T=\{1,1,1,2,3,4\} \implies P=24$
- $T=\{1,1,2,2,2,4\} \implies P=32$
- $T=\{1,1,2,2,3,3\} \implies P=36$
- $T=\{1,2,2,2,2,3\} \implies P=48$
- $T=\{2,2,2,2,2,2\} \implies P=64$
So all other sets have unique products given the same number of elements. Thus, one solution to this puzzle is:
$$S=12$$
Knowing that it is impossible to know $T$ given $|T|$ and $P$ lets Beth determine that
$$P=48$$
since all other combinations of $|T|$ and $P$ uniquely identify $T$.
Is this unique?
However, are there answers larger than this? Lets explore!
Assume $S \ge 13$
Now consider:
- $T=\{1,6,6,S-13\} \implies P=36 \times (S-13)$
- $T=\{2,2,9,S-13\} \implies P=36 \times (S-13)$
- $T=\{1,3,4,4,S-12\} \implies P=48 \times (S-12)$
- $T=\{2,2,2,6,S-12\} \implies P=48 \times (S-12)$
If $T$ is one of the above and Beth is given $S$, $P$ and $|T|$, then there is no way to uniquely identify the set $T$. Likewise, since there are multiple values for $P$, Beth cannot logically determine the true value of $P$ even if she knows she can't get $T$ from knowing $|T|$ and $P$.
Thus we can rule out
$S \ge 13$
Making,
$$S=12, P=48$$
a unique solution.