Decomposing a non-negative integer into a sum of at most four squares
For the integer expression you can use parentheses and the usual operators
+ - * / % (modulo), ^ (exponentiation) and ! (factorial). In addition the following functions are predefined:
- prime(n): Computes the smallest (probable) prime p ≥ n
- sqrt(n): Computes y such
that y2 ≤ n < (y + 1)2
- ip(n): Computes the n-th prime (ip(1) = 2)
- pp(n): Computes the product of the first n (probable) primes
- d(min, mod, rem): Computes the smallest odd (probable) prime
p ≥ min which is congruent rem modulo mod. Make sure
that mod ≥ 1 and that gcd(mod, rem) = 1.
For more information, look at:
Last updated on 23-Aug-2006.
home