Based only on the giving information , it is garunteed that side AB and side CD
1 answer:
You might be interested in
The nth term is
an=a1(r)^(n-1)
an=1(2)^(n-1)
a1=1
r=2
the sum of a geometric seequence is
a1=1
r=2
we want to find
(since we minus 1, the highest exponet is 9 so add 1 to make it correct)
an=a1(r)^(n-1)
an=1(2)^(n-1)
a1=1
r=2
the sum of a geometric seequence is
a1=1
r=2
we want to find