Palindromic prime by hallvabo

class Q{static{for(int x=2;x<2e4;x=new java.math.BigInteger(x+"").nextProbablePrime().intValue())if((x+"").equals(new StringBuffer(x+"").reverse()+""))System.out.println(x);}}

Note that non-ascii characters in the above source code will be escaped (such as \x9f).

download

return to the top page