PLEASE HELP I NEED THE ANSWER FOR MY HOMEWORK TODAY!!! Draw a flow diagram for an algorithm which calculates how many numbers 1, 2, 3…n have to be added to reach a total greater than 500. Output the answer n.

Explanation:

Lets use arithmetic progression

so S= n(2a₁ + (n-1)d /2 assuming common difference is 1

so sum must be greater than 500

⇒n² +n /2 >500

⇒n² + n >1000

⇒n² + n -1000>0

For the algorithm

For int n =1 to ∞ ,

if n² + n -1000<0

then continue

else print (n)

solution:

this situation is called an ip conflict.

data from a server is sent in small bits called packets. in an ip conflict, some packets will end up in one computer while some other packets will end up in another computer.

so…overall none of the computers get the data as the original message or picture being sent by the server cannot be retrieved with only half the packets. so it will show up as an error.

thus the final answer is d.

only #2 represents an object at rest on a table.

in #1, there is no normal force due to the table; the object is accelerating downward.

in #3, the vertical forces are not balanced; the object is accelerating downward.

in #4, neither the vertical nor the horizontal forces are balanced. the object is accelerating upwards and to the right.