Answer:
Hope this helps...
Step-by-step explanation:
P stands for polynomial time. NP stands for non-deterministic polynomial time. Definitions: Polynomial time means that the complexity of the algorithm is O(n^k), where n is the size of your data (e. g. number of elements in a list to be sorted), and k is a constant.
Now, a German man named Norbert Blum has claimed to have solved the above riddle, which is properly known as the P vs NP problem.
Answer:
y = 2x + 20


Step-by-step explanation:
Vlad spent 20 minutes on history. Then Vlad spent 2 minutes on each math problem for homework, this is 2x. So in total, he spent 20+2x on homework. Depending on how many problems he did, the total time y can be found. This is the equation 20+2x=y.
If Vlad did 0 math problems then he spent at least 20 minutes on homework from history. This is the constraint
.
We also know Vlad can do many math problems but the least amount he did was 0, so the second constraint is
.
The diagonal is solved by a^2+b^2=c^2
c=8 in this problem, so c^2=64
Since the figure is a square, a must equal b.
64/2=32, each side is root of 32 units
the square root of 32 is approximately 5.66.