The key is to figure out how to calculate the maximal number of bad products in (2N/15) products.
We know that every N/5 products have no more than 1 bad product. And we know that 2N/5, no more than 2. And 2N/3 , no more than 3. And 4N/5, no more than 4.
Therefore, (4N/5 - 2N/3) = 2N/15 will not have more than (4-3) = 1 bad product.
For this question, I prefer to have A has not more than 3, B has no more than 2, c has no more than 1, and A+B+C =N. Then the things would become quite easy. Unfortunately 2/3 + 2/5 >1. So we cannot simply plug in those numbers.
Then the question is how to get the N exactly!
Basically 2N/5 and N/5 talk about the same thing. You just treat these two conditions as the same.
Then you have to plug in the 2N/3 condition. Now we are limited to ONLY 2N/3 and N/5. The difference between them and N is 2N/15. We need to know what is the POSSIBLE maximum number of products that are bad in 2N/15 products! One (1) is the answer as I just deduced above. It cannot be more than 1.
As to why not use ONLY 2N/5 and N/5 conditions, the reason is that you are omitting the 2N/3 condition by limiting yourself to 2N/5 and N/5!
Figure out how to have A has no more than a bad products, B has no more than b bad products, C has no more than c bad products, and A+B+C =N. Most likely you will have to calculate the last condition from the combination of the first two.
Figure out how to have A has no more than a bad products, B has no more than b bad products, C has no more than c bad products, and A+B+C =N. Most likely you will have to calculate the last condition from the combination of the first two.