A jar contains some number of pennies. When pennies are removed 2, 3, 4, 5, 6 or 8 at a time, one penny is left over. There are no pennies left over when they are removed 7 at a
time. What is the least number of pennies that could be in the jar?

Step-by-step explanation:

Let say n the number of pennies in the jar.

n is a multiple of 7 : n=7*k

n-1 is a multiple of 2,3,4,5,6,8 so a multiple of the lcm= 120

n-1=120*t

n-1=120*t

n=7*k

120*t=7k-1

7k=120*t+1

The least number of pennies is 721 (when a=0)

Proof:

n-1=720

720/2=360

720/3=240

720/4=180

720/5=144

720/8=90

721/7=103

10

step-by-step explanation:

7+3=10