I tried this problem, but my solution is to slow and I wonder how i can make it faster.
currently i go for each number from 2 to n/2 and look, if it is a prime number or not. if not, i put this number in an arraylist, so next time, i only have to look, if the number is in this list.
then if n%2=0 i look, if n minus the current number is also a primenumber. if n%2=1 I sum up two primenumber and look, if n minus this sum is also a primenumber.
Can someone help me finding a faster solution?
thanks in advance!!