Search:

No, I found an array online, formatted their list to match the format of mine and did a 'diff' in the terminal.

Edit: It starts checking about 20k/second. The output file has gone up to...

I believe this would fall under homework policy as well. I've been a member of a few sites like this one Matt, you're not very likely to come across a forum that will actually help you do that. ...

Here's some output in case anyone wants to test:
17613047
17613049
17613061
17613091
17613097
17613137
17613143
17613151
17613191

I also said 8 gigs... meant mibs (how Ubuntu refers to megabytes)... As you all may or may not have been able to tell. I've been very tired lately.

THIS is the source code I meant to post lol. ...

Yes I did, I just copy/pasted from the backup source file lol. You guys are going to have to forgive me for that. Nano isn't exactly the friendliest of text editors when it comes to mouse usage and...

In the above post I said it now takes me 20 minutes to make a file of 8 gigs. Not so. That was before I implemented the changes. Now it takes about 30 seconds :)

My parents think I'm hacking......

I did actually, I just didn't update this since. I've made a few improvements to the code, but yeah. One of them is only checking odd numbers, then I implemented the sqrt without sqrt. It's been...

You just couldn't settle for a Hello World eh?


#include <stdio.h>
#include <stdlib.h>
#include <math.h>

void mainmenu();
int joke();
int calculator();

Started over, rewrote the majority of it using a dry-erase board. It works rather well now. Any thoughts, comments, suggestions, etc. are welcome and appreciated.
#include<stdio.h>...

I'm confused by that. I moved the variables from the top and inside int main() and int isPrime() and it's still happening just as before. Or were you referring to something else?


//snip...

Updated the source and now it hangs after printing two numbers.

#include<stdio.h>
#include<math.h>
#include<limits.h>
long long int testNum;
long long int testAgainst=2;
short int isNumPrime;...

Thank you for taking a peek grumpy.
#include<stdio.h>
#include<math.h>
#include<limits.h>

long long int testNum;
long long int testAgainst;
short int isNumPrime;

int isPrime(long long int...

#include<stdio.h>
#include<math.h>
long long int testNum;
long long int testAgainst;
short int isNumPrime;

int isPrime(long long int testNum, long long int testAgainst);

int main()
{

Seriously... I'm not easily annoyed, but this is ridiculous. You're ignoring everything everyone is telling you.

ctrl+z may or may not make an EOF character, that's not the point.

The point...

Thank you :) I'll be reading this for a while if anyone needs me.

Also, in case anyone was curious, I found the limit.

/* Minimum and maximum values a `signed long long int' can hold. */
# ...

I understand that first part now, thank you though.

I'm likely not going to keep GMP installed after I write, compile, and run this program once to generate the file. Afterwards I might remove...

I want to go as high as I possibly can, and GMP is installed now. So how would I go about going higher with GMP?

Edit: In case anyone wanted to know why, after all, this is completely...

So after installing GMP I'd use:
uint64_t primeNum; in order to declare something larger than what my compiler would normally be able to handle?

I have 6 gb of RAM and an Intel quad core 2.5ghz processor... that change anything (I don't think so, but I don't mind asking)? I can take only being able to calculate prime numbers up to...

Well... I imaging you know how to check if a number is prime, as for the range--which as I understand the situation is what you have a problem with--then you only need to check numbers between 2 and...

A while back I created a program to check if a number was prime. Basically it checked to see if a number was divisible by any number between 2 and it's square root, if it returned true, the number...

You're really confusing. What is (n!)^2? Is that any number to the second power? Any number XOR'ed to the second power? Then you start talking about brute force and prime numbers. Can you sum up...

Well... a prime number is any number that isn't divisible by any number than itself. So once you find a factor or whatever it is you're looking for up there ^^^ you add a bit to check if that number...

Seriously... I don't know anyone who is going to sift through 728 lines of code to fix your problem... especially when it uses gets(), itoa(), strcmpi(), etc.

Tried to compile after a rewrite and...

I have no idea. I'm using linux and ctrl+z isn't used for EOF.