LinkedListDemo for find the all prime numbers within the 0 and entered maximum number

LinkedListDemo

import java.util.Iterator;
import java.util.LinkedList;
import java.util.List;
import java.util.Scanner;

public class LinkedListDemo {

  public static void main(String[] args) {
		System.out.println("Primes : ");
		Scanner console = new Scanner(System.in);
		System.out.println("Maximum Number ? ");
		int max = console.nextInt();
		List<Integer>primes=sleve(max);
		System.out.println("upto " +max);
		System.out.println(primes);
	}

	public static List<Integer> sleve(int max) {
		List<Integer> primes = new LinkedList<Integer>();
		List<Integer> numbers = new LinkedList<Integer>();
		for (int i = 2; i <= max; i++) {
			numbers.add(i);
		}

		while (!numbers.isEmpty()) {
			int front = numbers.remove(0);
			primes.add(front);

			Iterator<Integer> itr = numbers.iterator();
			while (itr.hasNext()) {
				int current = itr.next();
				if (current % front == 0) {
					itr.remove();
				}
			}
		}
		return primes;
	}
}