ArrayList of prime numbers

import java.util.*;

public class test {
    public static void main(String[] args) {
        System.out.println(primeFinder(13));
    }

    public static ArrayList primeFinder(int n) {
        ArrayList<Integer> integerArray = new ArrayList<Integer>();
        
        for (int i = 1; i <= n; i++) {
            int count = 0;
            for (int j = i; j >= 1; j--) {
                if (i % j == 0) {
                    count++;
                }
            }
            if (count == 2) {
                integerArray.add(i);
            }
              
        }
        return integerArray;
    }
}

Similar codes

1 vote215 views1 answer
Shakescleare merchant of venice
Java
0 vote210 views1 answer
Required a bean of type 'org.springframework.security.crypto.bcrypt.BCryptPasswordEncoder' that could not be found.
Java Spring
1 vote202 views1 answer
How to add elements to an array in java dynamically
Java
0 vote232 views1 answer
Spring boot save file to static folder
Java Spring
0 vote215 views1 answer
Charstreams cannot be resolved
Java
0 vote199 views1 answer
Hackerrank valid username regular expression
Java
0 vote198 views1 answer
How to create a java jframe
Java
136 votes279 views6 answers
Java random number
Java
9 votes249 views2 answers
Change spring port
Java Spring
15 votes207 views1 answer
Java random w3
Java