+0  
 
0
21
2
avatar

Jax bought exactly enough trees to plant eight equal rows. Then one tree died and couldn’t be planted, but he still had enough trees left to plant exactly nine equal rows. After that, a tree was stolen, but he still had enough trees left to plant exactly ten equal rows. If he bought the least number of trees satisfying these three conditions, how many trees did he buy?

 May 23, 2020
 #1
avatar+23566 
0

https://web2.0calc.com/questions/divisibility-remainders

 
 May 23, 2020
 #2
avatar
0

n mod 8 =0
n mod 9 =1
n mod 10 =2

The LCM of 8/2, 9, 10/2 =180

Using "Chinese Remainder Theorem + Modular Multiplicative Inverse"
180  +  172 = 352 minimum number of trees

 
 May 23, 2020

3 Online Users