Question

If the string is cut into n pieces, what is the greatest possible value of n?

A. 400
B. 500
C. 600
D. 700

Answer 1

The maximum number of pieces that can be obtained by cutting a string into n pieces is given by the formula: N = (n(n+1))/2 + 1. Given that the maximum number of pieces is 700, the greatest possible value of n is 26.

Step-by-step explanation:

The maximum number of pieces that can be obtained by cutting a string into n pieces is given by the formula:

N = (n(n+1))/2 + 1

Given that the maximum number of pieces is 700, we can solve for n as follows:

1. 700 = (n(n+1))/2 + 1
2. 700 = (n^2 + n)/2 + 1
3. 700 = n^2 + n + 2
4. n^2 + n - 698 = 0
5. Solving this equation, we find that n ≈ 26.78
6. Since n must be an integer, the greatest possible value of n is 26.