Search DaniWeb - prime-factors

Prime Factors Help 14 Years Ago by westsider123 …and(*), Example : Enter number : 8 Prime factors of '8' : 2^3 Enter number : 56 Prime factors of '56' : 2^3*7…]#include <stdio.h> /* Find out the prime factors * of a given number and print * them on …d = 2; if(n < 2) return; printf("Prime factors of '%d': ", n); /* while the factor being tested… Prime Factors 14 Years Ago by westsider123 …(*) Example : Enter number : 8 Prime factors of '8' : 2^3 Enter number : 56 Prime factors of '56' : 2^3*7…include <stdio.h> /* Find out the prime factors * of a given number and print * them on … d = 2; if(n < 2) return; printf("Prime factors of '%d': ", n); /* while the factor being tested … Re: Prime Factors 14 Years Ago by diniboi … L2 num = int(raw_input()) p = prime(num) print num," = ",p primes = set((p)) factors = [] for z in primes: if… (0 == num%z): num /= z factors.append(z) factors.sort()[/CODE] But as you can see it still…660 = 2.2.3.5.11 The output of the prime factors when multiplied should equal my original input. Prime Factors 14 Years Ago by diniboi … is a positive integer, the program should reduce it to prime factors. The integer is less than 900. The program should Output… the prime factors as a series that when multiplied together, will return the… Prime Factors 13 Years Ago by jdm I'm working on a program that will find the prime factors to an unsigned integer that is entered by the user. … go from here. I know I have to find the prime factors that make up that number using a jump loop and… Re: Prime Factors 13 Years Ago by jdm … mEx: [/CODE] checks if number in eax is prime. If it is prime edx will contain 1, otherwise 0. Insert this code… program, the program will display 2 * 2 * 5 as the prime factors that make up 20. I really appreciate the help. Sincerely… prime factors 15 Years Ago by poornimashobana hi , anybody would help me how to print prime factors in c using recursive function Re: Prime Factors 14 Years Ago by Tellalca … to get two things at the same time. Find the prime numbers between 1 - 100 then go to the algorithm that… If your number is in the list of prime Print prime Else Calculate the numbers prime factors by dividing it to the primes starting… Re: Prime Factors 14 Years Ago by abhimanipal …=0x69;1222598]Also this branch is totally wrong- [CODE] /* invalid prime factor */ else { if(d == 2) d = 3; else d += …2; } [/CODE] this code will fail after prime P=7 -> 7+2 = 9, but 9 is not…] So this approach is BAD. Instead you must save prime numbers into some array kind of [CODE=C]int primes… Re: Prime Factors 14 Years Ago by 0x69 Also this branch is totally wrong- [CODE] /* invalid prime factor */ else { if(d == 2) d = 3;… += 2; } [/CODE] this code will fail after prime P=7 -> 7+2 = 9, but 9 …is not prime number, instead after 7, next prime factor should be 11. [url… approach is BAD. Instead you must save prime numbers into some array kind of [CODE=… Re: Prime Factors 14 Years Ago by Banfa Instead of outputting every time you find a prime factor you need to increment a count of the number of times you have had that prime factor. Then when you find a new prime factor output the data for the previous prime factor. Re: Prime Factors 14 Years Ago by griswolf …'s a hint: [CODE]primes = set((2,3,5,7)) factors = [] for p in primes: if 0 == num%p: num /= p… so as to check even more possible factors, and handle multiples of the same prime. You can do it two ways:[list… primes while checking [*]Create a list of "all possible prime candidate factors" first, then check them all [/list]Option 1… Re: Prime Factors 14 Years Ago by mciperf …% p == 0: factors.append(p) n /= p return factors primes = gen_primes(900) print primes factors = factors_f(660) print factors factors = [str(f) …for f in factors] print " * ".join(factors), "=", 660… Re: Prime Factors 14 Years Ago by TrustyTony … n % p == 0: factors.append(p) n /= p return factors primes = gen_primes(900) print primes factors = factors_f(660) print factors factors = [str(f) for f… Re: Prime Factors 14 Years Ago by TrustyTony …: from functools import reduce # for Python3 except ImportError: pass def factors(x): divisor = 2 if x < 4: if x <…, 901): print('%4i' % n, '.'.join(str(f) for f in factors(n))) assert reduce(mul, factors(n)) == n [/CODE] Re: Prime Factors 13 Years Ago by skaa … mEx: [/CODE] checks if number in eax is prime. If it is prime edx will contain 1, otherwise 0. Insert this code… Re: Prime Factors 13 Years Ago by skaa I am sorry, I gave you incorrect explanation. This piece of code just checks if the number in EAX is prime or not prime. It can be solved without PUSH and POP but it is not good idea. PUSH command adds to stack, POP - extracts from stack. Re: Prime Factors 13 Years Ago by jdm Thank you for the help Skaa. I really appreciate it. I'm taking it that the program doesn't accept 0 and 1, because they are not prime? Thanks for the help again. Sincerely yours; jdm Re: Prime Factors 13 Years Ago by skaa It is impossible to factor 0 or 1 by prime numbers. Re: prime factors 15 Years Ago by xavier666 … check whether the number is prime or not [*]If it is prime, print the number [/list] Algorithm for prime [list] [*]Take the number…division, there is no remainder, signal that PRM is not prime [*]If, at the end of all such divisions, no divisor… has been found, signal that PRM is prime [/list] Try to convert this into code Finding prime factors and distinct prime factors 15 Years Ago by sambho … I have some problem regarding getting prime factors and distinct prime factors. I manged to get the prime factors but I got stuck on how to… get the distinct prime factors.........I don't know how to select unique prime factors and print them....Help me out… Re: Finding prime factors and distinct prime factors 15 Years Ago by c coder … guys I have some problem regarding getting prime factors and distinct prime factors. I manged to get the prime factors but I got stuck on how… to get the distinct prime factors.........I don't know how to select unique prime factors and print them....Help me out… Re: Finding prime factors and distinct prime factors 15 Years Ago by c coder … guys I have some problem regarding getting prime factors and distinct prime factors. I manged to get the prime factors but I got stuck on how… to get the distinct prime factors.........I don't know how to select unique prime factors and print them....Help me out… Re: Finding prime factors and distinct prime factors 14 Years Ago by rajanpathak …;, &number); if(number==2){ printf("Number is Prime and Prime Factor is %d",number); exit(0); } for(i…int j; int p[1000][2]; j=number; printf("Prime factors are\n"); for(i=2;i<=number;i…1]; } printf("Total No of prime Factors are:%d\n",pf); printf("Distinct No. prime factors are:%d",k); }[/CODE] Recursion prime factors (no loops of anykind) 13 Years Ago by dippatel … primefactor(long int num); printf("Enter the number whose prime factors are to be calculated:"); scanf("%ld", &… ifprime = 1; i++; } return (ifprime); } //The following function prints the prime factors of a number. long int primefactor(long int num) { long… Re: Finding prime factors and distinct prime factors 15 Years Ago by WaltP You need to [url=http://www.gidnetwork.com/b-38.html]format your code[/url] before posting... No idea what you are asking. Distinct prime factors? Of what? Show us an example... Re: Finding prime factors and distinct prime factors 15 Years Ago by dkalita I dont know what u r asking but a liked your algo for finding prime factors. Explain your query in a little more detail. Finding Prime Factors 15 Years Ago by saba_shakeri … im writing a program in C that will find the prime factors of a number. When i compile it and put in…:"); scanf("%d",&n); printf("\nThe prime factors of %d are",n); for(k=2; k*k… Re: program when given an i nterger reduces it to prime factors 14 Years Ago by brixton d def factor (n): """returns a list of the prime factors of interger n""" factors = [] p = primes.generator() # yields an infinite list while n > 1 : x = p.next() while n % x == 0: n = n/x factors.append (x) return factors Re: program when given an i nterger reduces it to prime factors 14 Years Ago by TrustyTony …;""returns a list of the prime factors of interger n""" factors = [] p = primes.generator() # yields an infinite list….next() while n % x == 0: n = n/x factors.append (x) return factors Could you explain your logic, especially how line 4…