Planet Chili

You only need to test up to sqrt(n) if n is your primenumber in case 1)

well y is defined again in the line: void checker(int y) so in the function there is no way to acces the gloabl variable y
( local scope beats global scope every time )

i decrypted it

I am Hidden. When I used a Caeser Cipher, I "did it" forward TWENTY times. Just for jour information Caeser Chiper, and Vigenere Chipher are linear chiphers, so it doesn't matter how often you apply them the "encryption" is not harder to break only the "key" is changed. example doing caesar twenty ...

i would recommend using OpenCl instead of cuda, because it is not platform dependent

The formula is right, but the example is wrong as hell. Vec1 needs to be [1,3,-4] and the result shoud be [4,-16,-11]

You are not clearing the screen in the beginnFrame function

maybe try

void D3DGraphics::BeginFrame()
{
HRESULT result;

result = pDevice->Clear( 0,NULL,D3DCLEAR_TARGET|D3DCLEAR_ZBUFFER,D3DCOLOR_XRGB(0,0,0),1.0f,0 );
assert( !FAILED( result ) );
}

Win 7 x64, I7-2600 3.4GHz 4x8gb ddr3 1333 ram
EventSpeedPushBack:
52.632813
51.932468
57.814079
59.831654
58.461891
57.925152

EventSpeedRun:
7.895282
7.991943
7.921098
7.906089
7.871567
7.839147

So if you aren't drawing the frames each step, then your code is still ~57 times faster. If you are rendering each step/grid update then your code is what ~200 times faster, crazy. So is sse all that you are using, or did you go with D3D shader? speeds are determinated by the hardware you use. So m...

So you created a new account. Whats the problem?