Search Results for ""

Let D be a subset of the nonnegative integers Z^* with the properties that (1) the integer 0 is in D and (2) any time that the interval [0,n] is contained in D, one can show ...

Let D be a subset of the nonnegative integers Z^* with the properties that (1) the integer 0 is in D and (2) any time that n is in D, one can show that n+1 is also in D. ...

A congruence of the form ax^2+bx+c=0 (mod m), (1) where a, b, and c are integers. A general quadratic congruence can be reduced to the congruence x^2=q (mod p) (2) and can be ...

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 ...