- 5 I Using Proof By Induction Show That 1 3 5 7 2n 1 N I Ii 1 2 3 N 1 6 N N 1 2n 1 Ii Su 1 (42.81 KiB) Viewed 7 times
5. i) Using Proof by Induction, show that: 1+3+5+7+...+(2n-1) = n² i) ii) 1² +2²+ 3² + + n² = (1/6) n(n+1)(2n+-1) ii) Su
-
answerhappygod
- Site Admin
- Posts: 899603
- Joined: Mon Aug 02, 2021 8:13 am
5. i) Using Proof by Induction, show that: 1+3+5+7+...+(2n-1) = n² i) ii) 1² +2²+ 3² + + n² = (1/6) n(n+1)(2n+-1) ii) Su
5. i) Using Proof by Induction, show that: 1+3+5+7+...+(2n-1) = n² i) ii) 1² +2²+ 3² + + n² = (1/6) n(n+1)(2n+-1) ii) Suppose program A takes fa(n)=30n+8 microseconds to process any n records, while program B takes fB(n)=n²+1 microseconds to process the n records. Which program would you choose, knowing you'll want to support millions of users? Why?