
Solution below.
Reveal solution by highlighting:
This one I sort of brute forced. I consider the first integer in my product. It might be 1, 2, 3 etc. Then I consider my product. It might be made of 2 integers, or 3, or 4 etc. In the rows below I consider each beginning integer, and I stop when I hit a 3 digit product. (If I continued, I would hit larger products, and I’m interested in the smallest.) The first column keeps going, until I hit a 3 digit product of 2 integers. (If I continued, I would hit larger products.) I don’t do 1 as a first integer, as the products would basically be the same as those with 2 as the first integer.
| 1st integer | 2 integers | 3 integers | 4 integers |
| 2 | 2*3=6 | 2*3*4=24 | 2*3*4*5=120 |
| 3 | 3*4=12 | 3*4*5=60 | 3*4*5*6=360 |
| 4 | 4*5=20 | 4*5*6=120 | |
| 5 | 5*6=30 | 5*6*7=210 | |
| 6 | 6*7=42 | 6*7*8=336 | |
| 7 | 7*8=56 | 7*8*9=514 | |
| 8 | 8*9=72 | 8*9*10=720 | |
| 9 | 9*10=90 | 9*10*11=990 | |
| 10 | 10*11=110 |
Having constructed my table, I look for the smallest 3 digit product. It turns out to be 110, our solution.