#include "test_helpers.h"
#include "fmpz.h"
#include "fmpz_vec.h"
#include "arith.h"
#define N 10
#define known known_sum_of_squares
static const fmpz known[N][N] = {
{1, 0, 0, 0, 0, 0, 0, 0, 0, 0},
{1, 2, 0, 0, 2, 0, 0, 0, 0, 2},
{1, 4, 4, 0, 4, 8, 0, 0, 4, 4},
{1, 6, 12, 8, 6, 24, 24, 0, 12, 30},
{1, 8, 24, 32, 24, 48, 96, 64, 24, 104},
{1, 10, 40, 80, 90, 112, 240, 320, 200, 250},
{1, 12, 60, 160, 252, 312, 544, 960, 1020, 876},
{1, 14, 84, 280, 574, 840, 1288, 2368, 3444, 3542},
{1, 16, 112, 448, 1136, 2016, 3136, 5504, 9328, 12112},
{1, 18, 144, 672, 2034, 4320, 7392, 12672, 22608, 34802}
};
TEST_FUNCTION_START(arith_sum_of_squares, state)
{
fmpz * r;
fmpz_t t;
slong i, j;
r = _fmpz_vec_init(N);
fmpz_init(t);
for (i = 0; i < N; i++)
{
arith_sum_of_squares_vec(r, i, N);
for (j = 0; j < N; j++)
{
fmpz_set_ui(t, j);
arith_sum_of_squares(t, i, t);
if (!fmpz_equal(t, r + j) || !fmpz_equal(t, known[i] + j))
{
flint_printf("FAIL:\n");
flint_printf("i, j = %wd, %wd, r[j] = %wd, r(j) = %wd, "
"expected: %wd\n",
i, j, fmpz_get_si(r + j), fmpz_get_si(t), known[i][j]);
fflush(stdout);
flint_abort();
}
}
}
_fmpz_vec_clear(r, N);
fmpz_clear(t);
TEST_FUNCTION_END(state);
}
#undef N
#undef known