We will use demonstration of recurrences<span>1) for n=1, 10= 5*1(1+1)=5*2=10, it is just
2) assume that the equation </span>10 + 30 + 60 + ... + 10n = 5n(n + 1) is true, <span>for all positive integers n>=1
</span>3) let's show that the equation<span> is also true for n+1, n>=1
</span><span>10 + 30 + 60 + ... + 10(n+1) = 5(n+1)(n + 2)
</span>let be N=n+1, N is integer because of n+1, so we have
<span>10 + 30 + 60 + ... + 10N = 5N(N+1), it is true according 2)
</span>so the equation<span> is also true for n+1,
</span>finally, 10 + 30 + 60 + ... + 10n = 5n(n + 1) is always true for all positive integers n.
<span>
</span>
Answer: No solution
Step-by-step explanation:
Answer:
y=7x + 5
Step-by-step explanation:
sub into y= mx + c
where m = slope/gradient (7)
and c = y-value of y-intercept (5)
Answer:
지금 당장받는 퀴즈에 대한 도움이 정말 필요 해요 ... 그냥 질문에 무작위로 답 해주셔서 ... 미안 해요 미안 해요 .. 또한 몬스타 엑스를 아시나요, 그들은 정말 좋은 그룹입니다
Step-by-step explanation: