Prime numbers with Java

Test.java

import java.util.HashMap;
import java.util.Map;

class Test {
    public static void main(String args[]) {
        int num = 100;
        Map<Integer, Boolean> list = new HashMap<Integer, Boolean>();
        for (int i = 2; i <= num; i++) {
            list.put(i, true);
        }
        for (int i = 2; i*i <= num; i++) {
            if (list.get(i)) {
                removeTimes(i, list, num);
            }
        }
        for (int i = 2; i <= num; i++) {
            if (list.get(i)) {
                p(i);
            }
        }
    }
    static void p(int out) {
        System.out.println(out);
    }
    static void removeTimes (int n, Map<Integer, Boolean> list, int num) {
        for (int i = n*2; i <= num; i+=n) {
            list.put(i, false);
        }
    }
}