ITS Sys Admin Pat is dealing with a computer virus outbreak. Pat esti- mates that every second at least 1 uninfected computer becomes infected for every 5 computers already infected on campus. To be exact there will be (C/5 newly infected computers in the next second if there are currently C infected computers. Pat is able to disinfect at most 10 computers per second. If Pat knows that there are at least 60 infected computers now, prove by induction that in n seconds there will be at least 12 6 10 + 50 infected computers. 5

Solution :

Let the base case, n = 0

Given at at least computers are infected

So,

Therefore, n = 0 is not true

Let suppose, it is true for n = k

Then,

We have to show that it is also true for

That is at the end of (k+1) second,

Now, the number of the infected computer that is added between and  second =

Now the number of the infected computer decreased between and  second is = 10.

Hence at the end of the second.

Number of the computers

Hence Proved

center= (-2,0)

radius= sqrt2/2

step-by-step explanation:

4

step-by-step explanation:

6 (donuts) divided by 3 is 2.

so 2/3 means 2 times 2, which is 4/6.

you get two and your friend gets four.