Answer:
There are 199 pairs of consecutive natural numbers whose product is less than 40000.
Explanation:
We notice that such statement can be translated into this inequation:
![n \cdot (n+1) < 40000](https://img.qammunity.org/2021/formulas/mathematics/high-school/5p323wtb8al34cdaq5mpc70o3byko1u7ps.png)
Now we solve this inequation to the highest value of
that satisfy the inequation:
![n^(2)+n < 40000](https://img.qammunity.org/2021/formulas/mathematics/high-school/ps9vtw9663a9rhz4cma0pk5631zbpmv23g.png)
![n^(2)+n -40000<0](https://img.qammunity.org/2021/formulas/mathematics/high-school/ehav8f2ysaial1louu2h0as40nwyjvrhmu.png)
The Quadratic Formula shows that roots are:
![n_(1,2) = \frac{-1\pm\sqrt{1^(2)-4\cdot (1)\cdot (-40000)}}{2\cdot (1)}](https://img.qammunity.org/2021/formulas/mathematics/high-school/87p9sal9lr2bpqdl9s0ag6gqa96c5xu6i8.png)
![n_(1,2) = -(1)/(2)\pm (1)/(2) \cdot √(160001)](https://img.qammunity.org/2021/formulas/mathematics/high-school/nkauf43h8rf6r8z6cl55zxh1ngy2c95d4t.png)
![n_(1) = -(1)/(2)+(1)/(2)\cdot √(160001)](https://img.qammunity.org/2021/formulas/mathematics/high-school/b6v2pnk23n856as1vm2qugi4herj953rpi.png)
![n_(1) \approx 199.501](https://img.qammunity.org/2021/formulas/mathematics/high-school/9dyt5qb59drtysq6qrf8u1et27bxqk61uk.png)
![n_(2) = -(1)/(2)-(1)/(2)\cdot √(160001)](https://img.qammunity.org/2021/formulas/mathematics/high-school/y7iacrpm5jckmuwsyd0ttcgwz0csego8ld.png)
![n_(2) \approx -200.501](https://img.qammunity.org/2021/formulas/mathematics/high-school/x3r3u7o5faip0ryo25edl41l8f2fm2dl70.png)
Only the first root is valid source to determine the highest possible value of
, which is
. Each natural number represents an element itself and each pair represents an element as a function of the lowest consecutive natural number. Hence, there are 199 pairs of consecutive natural numbers whose product is less than 40000.