Search DaniWeb - primes

Primes 12 Years Ago by Wh1t3gh0st … that takes the users input and finds that many primes; not the primes of the number from the user just that many…: .~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~. SECTION .bss input: resd MAX_NUMBER ; user input the amount of primes to be displayed numCount: resd 3 ; current number to check… Re: primes 18 Years Ago by Matt Tacular … i % divisor == 0: prime = 0 break if prime: primes.append(i) print "primes between %d and %d:" % (r3,r) #if… one. #So you could use this: # "print primes" for prime in primes: print prime, start_number = 100 #change this number to… Re: Primes 20 Years Ago by tyalangan …;%d", &n); primes =1000; i=0; while(primes <= n){ if (is_prime…i)){ printf("%d\t%d\n",primes,i); ++primes; } i+= 1000; } return 0;… Re: primes 18 Years Ago by Matt Tacular … others, so let's just add it ourselves. primes = [2] #Start at 3 and go up…divisor == 0: prime = 0 break if prime: primes.append(i) print "primes between 1 and %d:" % (r) …seems to go faster #with large amounts of primes instead of going through the list one by one… primes 18 Years Ago by Mouche … constructive criticism. [php] def print_primes(r=10): primes = [ ] for i in range(2,r+1…0: prime = 0 break if prime: primes.append(i) print "primes between 1 and %d:" % (r…) for prime in primes: print prime, print_primes() [/php] Thanks. EDIT:… Re: primes 18 Years Ago by bumsfeld …constructive criticism. [php] def print_primes(r=10): primes = [ ] for i in range(2,r…: prime = 0 break if prime: primes.append(i) print "primes between 1 and %d:" %… (r) for prime in primes: print prime, print_primes() [/php] Thanks.… Re: primes 18 Years Ago by Mouche … works okay, but this way, you can't do, say, primes from 100-200... you have to start with 1. Perhaps…) and then remove all numbers under 100 from your "primes" list. Meh, then it's not really more efficient… Re: primes 17 Years Ago by vegaseat … = prime(15000) # check the first 10 primes print prime_list[:10] # check the last 10 primes print prime_list[-10:] [/code]This particular prime… Primes 20 Years Ago by tyalangan …gt; int is_prime(int n); File: is_prime.c #include "primes.h" int is_prime(int n) { int k, limit;… 0) return 0; return 1; } File: main.c #include "primes.h" int main(void) { int n, prime, count; printf… Re: Primes 20 Years Ago by tyalangan Ok fixed it up a little... #include "primes.h" int main(void) { int pi; int n;…quot;, "where pi(x) is the number of primes\n" "less than or equal to x."…;); printf("\n%s", "How many primes do you want to consider?"); scanf("%d"… primes between 2 limits 13 Years Ago by tubby123 hey, is there an optimized way to generate primes between 2 limits ? I was recently asked this question in … Re: primes between 2 limits 13 Years Ago by TrustyTony … numbers upto sqrt of upper boundary and do is_prime using primes from that smaller sieve. Primes in the first positive integers. 7 Years Ago by Abenezer_1 Write a program that establishes all the primes in the first positive integers. [ C++] Re: Primes in the first positive integers. 7 Years Ago by rproffitt … written in over 20 languages. Let's find out. Category: Primes -> https://rosettacode.org/wiki/Category:Prime_Numbers Classic solutions: ->… Re: Primes 15 Years Ago by lllllIllIlllI There are a great many prime number generators in the code snippet sections :) [url]http://www.daniweb.com/code/forum114.html[/url] Otherwise, i would look at techniques to find primes. Then come back with some code if you have any issues. Here is a great idea [url]http://en.wikipedia.org/wiki/Sieve_of_Eratosthenes[/url] Re: primes 17 Years Ago by arsham [code] myarray = [2,3] def prime(x): for i in range(3, x,2): if filter(lambda x: i % x, myarray) == myarray : myarray.append(i) [/code] Re: primes 17 Years Ago by arsham I was thinking of the smallest code This must go to sqr(x) while checking for being divide by x So in that situation , this would be faster Looking forward to see better solution Good job dudes Arsham Re: Primes 20 Years Ago by Narue >scanf("%d,&n"); >n = 0; This assignment is suspicious. >prime = 1; >while(prime < n) 1 is not less than 0; your loop will never execute. Re: Primes 20 Years Ago by Narue >haha! it's suspicious b/c it's the wrong problem... >This is the real main.c... What is this? Some sort of sick game? "Guess the problem." "Well, it's obviously <so and so>." "Wrong! I fooled you by giving you the wrong problem! Haha!" Re: primes program 17 Years Ago by skyah This is the error message I got; fatal error C1083: Cannot open include file:'primes.h' no such file or directory. The problem I am talking about is with chapter 4 ass. 12 (primes program). Re: primes program 17 Years Ago by Narue Okay, the problem is that you're trying to include primes.h, but it doesn't exist in your project. Re: List of Primes 17 Years Ago by vijayan121 …prime_list( int limit ) ; std::vector<int> primes ; private: bool is_prime( int number ) const ; …prime_list( int limit ) { if( limit > 2 ) primes.push_back(2) ; for( int number=3 ; number<… main() { prime_list list(500) ; copy( list.primes.begin(), list.primes.end(), ostream_iterator<int>(cout,"\n")… Re: List of Primes 17 Years Ago by SurviBee … namespace std; class Primelist { public: vector<long> primes; void Start(); void Print(); void Populate(long limit); }; …cout << endl << endl; Primelist primes; primes.Start(); primes.Populate(limit); primes.Print(); cin.get(); cin.get(); return 0; } … Re: Segfault in Primes Program 15 Years Ago by csurfer …int i = 1; int j; printf ("How many primes? "); scanf ("%d", &maxprimes); [/code…int i = 1; int j; printf ("How many primes? "); scanf ("%d", &maxprimes); //…your solution is this statement primes = (int *)malloc(maxprimes * sizeof(int)); [/code] And… List of Primes 17 Years Ago by SurviBee … the number onto the end of the list of primes and continue until I have reached an inputted value.…your prime search.\n"; cin >> input; Primelist primes(input); primes.Print(); cin.get(); cin.get(); return 0; } //------------------------------------------------------------------------------ Primelist… Segfault in Primes Program 15 Years Ago by orwell84 …;maxprimes); printf ("2 is prime\n"); primes[0] = 2; while (count < maxprimes… = 1 ; j < maxprimes ; j++) { if (value % primes[j] == 0) { composite = 1; break; } } if (composite… = 0){ printf ("%d is prime", value); primes[j] = value; count += 1; j++; } } }… Re: Segfault in Primes Program 15 Years Ago by siddhant3s … passed a constant value,100 as size*/ int primes[MAXPRIMES]; int composite; int i = 1; int…get us back*/ printf ("2 is prime\n"); primes[0] = 2; while (count < maxprimes){ composite …for (j = 1 ; j < maxprimes ; j++) { if (value % primes[j] == 0) { composite = 1; break; } } if (composite = 0… Re: Segfault in Primes Program 15 Years Ago by orwell84 …d", &maxprimes); int *primes = malloc(maxprimes * sizeof(int)); if(primes == NULL) { fprintf(stderr, "… printf ("2 is prime\t[#1]\n"); *primes = 2; while (count < maxprimes){ composite = … (j = 0 ; j < count ; j++) { if (value % (*(primes + j)) == 0) { composite = 1; break; } } if (composite … Re: Circular Primes 14 Years Ago by TrustyTony … # http://stackoverflow.com/questions/2068372/fastest-way-to-list-all-primes-below-n-in-python/3035188#3035188 """ Returns…quot; not_these = set('245680') primes_left = set([prime for prime in primes if (prime<10 or not (not_these & set(str… C++ Calculating Primes in first 50 chiliads 11 Years Ago by erinkay528 …(long x, long y); // Returns the number of primes between x and y, inclusive int main () { int …lt;< setw(24) << "Number of Primes" << endl; primeCount (0 , 50000); cout… << "Total primes in the first 50 chiliads:" << total …