genius - en to en_CA translation catalogue (20 entries)

en: How many iterations to try to find the limit for continuity and limits
en_CA: Number of iterations to try to find the limit for continuity and limits

en: Logarithm of any base (calls DiscreteLog if in modulo mode), if base is not given, e is used
en_CA: Logarithm of any base (calls DiscreteLog if in modulo mode). If base is not given, e is used

en: Given two factorizations, give the factorization of the product, see Factorize
en_CA: Given two factorizations, give the factorization of the product. See Factorize

en: Compute phi(n), the Euler phi function, that is the number of integers between 1 and n relatively prime to n
en_CA: Compute phi(n), the Euler phi function, the number of integers between 1 and n relatively prime to n

en: Check if g is primitive in F_q, where q is a prime.  If q is not prime results are bogus.
en_CA: Check if g is primitive in F_q, where q is a prime.  Results are bogus if q is not prime.

en: Check if g is primitive in F_q, where q is a prime and f is a vector of prime factors of q-1.  If q is not prime results are bogus.
en_CA: Check if g is primitive in F_q, where q is a prime and f is a vector of prime factors of q-1.  Results are bogus if q is not prime.

en: Moebius mapping using the cross ratio taking infinity to infinity and z2,z3 to 1 and 0 respectively
en_CA: Moebius mapping using the cross ratio taking z2,z3,z4 to 1,0, and infinity respectively

en: Can't add/subtract a scalar to non-square matrix (A + x is defined as A + x*I)
en_CA: Cannot add/subtract a scalar to non-square matrix (A + x is defined as A + x*I)

en: Variable '%s' used uninitialized, perhaps you meant %s.
en_CA: Variable '%s' used uninitialized; perhaps you meant %s.

en: Function '%s' used uninitialized, perhaps you meant %s.
en_CA: Function '%s' used uninitialized; perhaps you meant %s.

en: Identity function, returns its argument
en_CA: Identity function: returns its argument

en: Return n/d but only if d divides n else returns garbage (this is faster than writing n/d)
en_CA: Return n/d but only if d divides n, else return garbage (this is faster than writing n/d)

en: Return pivot columns of a matrix, that is columns which have a leading 1 in rref form, also returns the row where they occur
en_CA: Return pivot columns of a matrix, columns which have a leading 1 in rref form. Also returns the row where they occur

en: Integration of f by Composite Simpson's Rule on the interval [a,b] with n subintervals with error of max(f'''')*h^4*(b-a)/180, note that n should be even
en_CA: Integration of f by Composite Simpson's Rule on the interval [a,b] with n subintervals with error of max(f'''')*h^4*(b-a)/180. Note that n should be even

en: %s should be between %d and %d, using %d
en_CA: %s should be between %d and %d. Using %d

en: %s should be greater then or equal to %d, using %d
en_CA: %s should be greater then or equal to %d. Using %d

en: Cannot open temporary file, cannot print.
en_CA: Cannot open temporary file; cannot print.

en: %s: No color specified
en_CA: %s: No colour specified

en: Can't convert complex number into a double
en_CA: Cannot convert complex number into a double

en: That's it, isn't this fun
en_CA: That's it. Isn't this fun?
