10000000000000000000000000000000000 00000000000000000000000000000000000 00000000000000000000000000000000000 00000000000000000000000000000000000 00000000000000000000000000000000000 x1093082675030398475685493202983475 67584930222222222394856785493292837 45894948756785484765785475657874567 83845757844757843745758943384576859 84576859857698576869857=

ih4 ;ipaoiwunrgopinrgn[oqner[gonreagheaarwg

Step-by-step explanation:

1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000x109308267503039847568549320298347567584930222222222394856785493292837458949487567854847657854756578745678384575784475784374575894338457685984576859857698576869857=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000x109308267503039847568549320298347567584930222222222394856785493292837458949487567854847657854756578745678384575784475784374575894338457685984576859857698576869857=

Step-by-step explanation:

i dont know if you cant find a way its best to actually add all of them start from 105 tho

step-by-step explanation:

option c) graph of line going through 1, 4 and 3, 10

step-by-step explanation:

let y equal to margo's coin collection

let x equal to number of years

at the begining x=0, y=1 → point=(x,y)→point=(0,1)

she adds 3 coins per year, then y=1+3x

at x=1, y=1+3(1)=1+3→y=4→point=(x,y)→point=(1,4)

at x=3, y=1+3(3)=1+9→y=10→point=(x,y)→point=(3,10)

the graph of line going through (1, 4) and (3, 10), then the option c is the correct.