![But since $ D $ must be divisible by 9, we list all multiples of 9 in [100,199]:](https://soloferat.biz.id/images/but-since--d--must-be-divisible-by-9-we-list-all-multiples-of-9-in-100199.jpg)
Related Articles
- But actually, we just need that $ B $ divides some multiple of 9 in that interval â which is always possible unless $ B $ is too large.
- But actually, the real constraint is: for the model to process full batches, $ B $ must divide $ D $, and $ D $ divisible by 9. So $ B $ must divide a multiple of 9. But every integer divides some multiple of 9 (e.g., $ D = B \cdot 9 $, but we require $ B $ divisible by 11).
- Better approach: we are to find the smallest $ B $ divisible by 11 such that $ B $ divides some $ D \in [100,199] $ with $ 9 \mid D $.
- 108, 117, 126, 135, 144, 153, 162, 171, 180, 189, 198
- Now check which of these are divisible by 11.
- ÷ 11 â 9.82 â not