Debug 3

public static bool ex3(int n)
{
    // FIXME expexted output: returns true if the number can be express as the sum of two primes
    int i, f1 = 1, f2 = 1, j;  // Remove f3
    for (i = 2; i < (n / 2) + 1; i++) // Change (n/2)+2 by (n/2)+1 | change i = 0 by i = 2
    {
        f1 = 1; // Change f1 = 0 by f1 = 1
        f2 = 1; // Change f2 = 0 by f2 = 1
        for (j = 2; j < i; j++) // Change j=4 by j=2
        {
            if (i % j == 0)
            {
                f1 = 0;
                j = i;
            }
        }
        for (j = 2; j < n - i; j++) // Change j = 0 by j = 2
        {
            if ((n - i) % j == 0) // Change (n-1) par (n-i)
            {
                f2 = 0;
                j = n - i;
            }
        }
        if (f1 == 1 && f2 == 1) // Change f1 == 0 by f1 == 2
        {
            return true;
        }
    }
    // if (f3 == 1)
    // {
    //     return false;
    // }
    return false;
}