We have that
<span>n (n-1) -4
for n=1
a1=1*(1-1)-4------> a1=-4
for n=2
</span>a2=2*(2-1)-4------> a2=-2
for n=3
a3=3*(3-1)-4------> a3=2
for n=4
a4=4*(4-1)-4------> a4=8
the answer is
-4,-2, 2, 8
<u>Answer</u>
49
<u>Explanation</u>
2 is an even number, so all even numbers can not be the smallest number required. Example 2, 4, 6, 8, 10, 12, 14......
All number that arr multiples of three also do not qualify for the number required. Example 3, 6, 9, 12, 15....
Numbers that not multiple of 5 do not also qualify. E.g 5, 10, 15, 20, 25.....
The smallest positive composite number is that is not divisible by 2,3 or 5 is 49.
Answer:
Step-by-step explanation:
Length of YM = 1 - (-6) [This is it's endpoints]
YM = 1 + 7
YM = 8
Length of PW = 9 - 5 [Subtraction of endpoints to get the length]
PW = 4
So, Segment YM is not congruent to segment PW.
4 walls need 262 people/minutes (7)(36)
1 wall takes 63 people/minutes (262/4)
7 walls need 441 people/minutes (63)(7)
9 people could do that in 49 minutes (441/9)
HOPE THIS HELPS!!!!
Hey man I’ve never seen nothing like this but I’d you’re doing math on ap classroom , man , GOOD LUCK
