Naive prime number filter chain

/* Naive prime number filter
 * Inspired by Unix pipes, though these short circuit as soon as they detect a non-prime
 */
package primenumberfilterchain;
public class PrimeNumberFilterChain {
    public static void main(String[] args) {
        int MAX_NUMBER = 10000;
        Filter filter = new Filter(1); // not prime, but we need to start with something

        for (int i = 2; i <= MAX_NUMBER; i++) { //Note we start from 2, the first prime
            if (filter.isPrime(i)) {
                System.out.println(i);
            }
        }
    }
}

class Filter {
    int myMultiple;
    Filter nextFilter;

    Filter(int number) {
        myMultiple = number;
        nextFilter = null;
    }

    boolean isPrime(int number) {
        if (myMultiple > 1 && (number % myMultiple == 0)) {
            return false;
        } else if (nextFilter != null) {
            return nextFilter.isPrime(number);
        } else {
            nextFilter = new Filter(number);
            return true;
        }
    }
}