- #1

heavyc

- 16

- 0

**Need Help proving these equations!**

I am in Discrete Math and i need a lot of help solving these equations and then proving them using a C++ program. If anyone could help I would really appreciate it. Please i need any sugggestions on this because i really can't seem to figure out how to do this and i can't even ask my teacher because he said that he isn't going to help us in any way.

For all integers n, 1 <= n <= 100, such that n^2 - 79n + 1601 is prime.

for a program what i got was

for( k = 1; k < 101; k++)

{

test = k^2 - (79 * k) + 1601;

for( i = 2; i < (test / 2 + 1); i++)

{

for( j = 2; j < (test / 2 + 1); j++)

{

product = i * j;

cout << i << " * " << j << " = " << product <<endl;

if(product == test)

cout << "success" << endl;

else

cout << "fail" << endl;

}

}

}

2. There exist positive integers u, v, x, y, z, 1 <= u <= v <= x <= y <= z <= 200, such that u^5 + v^5+ x^5 + y^5 = z^5. and same thing with the C++ program but i couldn't figure this one out.