Small program that skips over many valid nonprimes but only prints nonprimes #include <stdio.h> unsigned integer = 0; unsigned int i = 0; int main (char argc, char* argv[]) { Feel free to tell me ways to improve this. |
Small program that skips over many valid nonprimes but only prints nonprimes #include <stdio.h> unsigned integer = 0; unsigned int i = 0; int main (char argc, char* argv[]) { Feel free to tell me ways to improve this. |
This is because of the relationship between the triangular numbers and the summation formula for integers.
Quite a lot is known about these and you can read references to a lot of it on that OEIS page (although some of it is kind of terse and assumes certain kinds of mathematical background). One thing you'll see there is a simple formula for computing these directly rather than by these repeated additions.
The primality issue is discussed at, for example,
https://math.stackexchange.com/questions/1012320/how-many-pr...
If you ever write a program that generates a particular sequence and you want to know whether that sequence has already been studied in mathematics, OEIS has a great search engine tool which lets you search for specific integer sequences just by entering their terms. The results will show you huge amounts of detail about what mathematicians have already discussed and discovered about that sequence, possibly including other ways of generating it, or other sequences or formulas that are related to it somehow.
Edit: I feel it would be more idiomatic in C to write the main() function as something like
int main(char argc, char* argv[]) {
for (i = 0; i < 1000; i++) {
integer += i;
printf("%u\n", integer);
}
};
In modern C practice it's also more usual to declare most variables inside of the specific function that uses them, rather than as global variables outside of any function.