Search Results for ""

A set A of integers is recursively isomorphic to set B if there is a bijective recursive function f such that f(A)=B.

Any system of phi(n) integers, where phi(n) is the totient function, representing all the residue classes relatively prime to n is called a reduced residue system (Nagell ...

An extension to the Berlekamp-Massey algorithm which applies when the terms of the sequences are integers modulo some given modulus m.

Let m and m+h be two consecutive critical indices of f and let F be (m+h)-normal. If the polynomials p^~_k^((n)) are defined by p^~_0^((n))(u) = 1 (1) p^~_(k+1)^((n))(u) = ...

Let P=a_1x+a_2x^2+... be an almost unit in the integral domain of formal power series (with a_1!=0) and define P^k=sum_(n=k)^inftya_n^((k))x^n (1) for k=+/-1, +/-2, .... If ...

Let j, r, and s be distinct integers (mod n), and let W_i be the point of intersection of the side or diagonal V_iV_(i+j) of the n-gon P=[V_1,...,V_n] with the transversal ...

An array B=b_(ij), i,j>=1 of positive integers is called a dispersion if 1. The first column of B is a strictly increasing sequence, and there exists a strictly increasing ...

If f(x)=f_0+f_1x+f_2x^2+...+f_nx^n+..., (1) then S(n,j)=f_jx^j+f_(j+n)x^(j+n)+f_(j+2n)x^(j+2n)+... (2) is given by S(n,j)=1/nsum_(t=0)^(n-1)w^(-jt)f(w^tx), (3) where ...

The name for the set of integers modulo m, denoted Z/mZ. If m is a prime p, then the modulus is a finite field F_p=Z/pZ.

A Skolem sequence of order n is a sequence S={s_1,s_2,...,s_(2n)} of 2n integers such that 1. For every k in {1,2,...,n}, there exist exactly two elements s_i,s_j in S such ...