Prime numbers
I am required to write a program which writes all the prime numbers between 1 and 10000, my only problem is that I cant find a way to determine the prime numbers from the rest! plz help! im not good at maths!
I wrote the following:
#include <stdio.h>
int prime (int);
int main ()
{
int i;
prime (i);
return 0;
}
int prime (int i)
{
i=1;
while ( i <=1000) {
if ( i % 2 == 1 && i % 3 == 1)
printf ("%d\n",i);
i++;
}
return i;
}
Last edited by Lazy Student; 05-13-2002 at 03:18 PM.
I assume you know what a prime number is, from the definition of a prime number it should be quite easy to write an algorithm for that. Unless you're a Real Lazy Student.
A little hint:
There are more efficient ways, hint: think about how the square root of n could make the algorithm more efficient. But this one is easy to understand, isn't it?Code:for n = 1 to 10000 do begin for i = 2 to n - 1 if (n mod i = 0) n_is_prime = false; end;
Plus: All even numbers are divisible by 2.
MagosX.com
Give a man a fish and you feed him for a day.
Teach a man to fish and you feed him for a lifetime.
10.000... your from europe right?
flashdaddee.com rocks!!!
LMAO. Guess what! Every fifth number is divisible by 5!Originally posted by Magos
Plus: All even numbers are divisible by 2.
Quzah.
Hope is the first step on the road to disappointment.
Thank you all!
no, im not from europe! i wont tell you where im from!10.000... your from europe right?
well, your not from the US (I dont mean that in an ******* kind of way, just the way you did your number 10.000 not 10,000).
flashdaddee.com rocks!!!
thats because of my stupid keyboard! i cant recognize the comma from the point!
What I meant was he doesn't have to check divisibility with every number between 1 and sqrt(n), just the uneven ones (except for 2). That cuts the checks by 50% which will make a great difference on huge numbers.Originally posted by quzah
LMAO. Guess what! Every fifth number is divisible by 5!
Quzah.
So please be careful with your flames in the future
MagosX.com
Give a man a fish and you feed him for a day.
Teach a man to fish and you feed him for a lifetime.
only those in the series 0,5,10...LMAO. Guess what! Every fifth number is divisible by 5!
I go to encounter for the millionth time the reality of experience and to forge in the smithy of my soul the uncreated conscience of my race.
Windows XP consists of 32 bit extensions and a graphical shell for a 16 bit patch to an 8 bit operating system originally coded for a 4 bit microprocessor, written by a 2 bit company, that can't stand 1 bit of competition.
fenix is right, it would be faster.
> Windows XP consists of 32 bit extensions and a graphical shell
> for a 16 bit patch to an 8 bit operating system originally coded
> for a 4 bit microprocessor, written by a 2 bit company, that
> can't stand 1 bit of competition.
I've heard this before, applied to Win9x. However, this is inaccurate for WinXP. Windows XP is not an extension of an 8 or 16bit OS at all. WinXP is based off of WinNT. Windows NT is NOT a 16bit OS.
Quzah.
Hope is the first step on the road to disappointment.
I had to do something similar. maybe it will help you:
int number=1;
while(number<=10000){
if (number<test*2)
{
printf("%4d",number);
i++; ref++; test=2;
}
else
if (number%test==0)
{
number++;
test=2;
}
else
test++;
}
