I never seem to have the problem at the time when it is being discussed here since I remember something about this in the past. I have 2 arrays and would like a 3rd that contains the set intersection of the 2. Each element in each is unique. This seems like a basic function but after searching in help, etc. I didn't come up with an elegant solution. Maybe its too basic and I should know it? Dave.