|
Need a suggestion for an algorithm.
For a given number N i have to find all the prime numbers it's consisting of, like this:
N = 49 49 = 7 ^ 2 N = 168 168 = (2 ^ 3) * (3 ^ 1) * (7 ^ 1)
If you want to help me even more you can write the algo in c++.
Thanks...
Started by ggg on
, 3 posts
by 3 people.
Answer Snippets (Read the full thread at stackoverflow):
For ....
Basically just try dividing n by each prime number up to sqrt(n).
Repeat until you have a prime straightforward way is trial division.
If you can then that number is one of your factors.
By an integer smaller than it.
|
|
Given an array of prime factors of a natural number, how can I find the total number of divisors using LINQ upon the original array? I've already figured out most of this problem, but I'm having trouble with my LINQ statement.
Math Background:
The prime...
Started by Ben McCormack on
, 3 posts
by 3 people.
Answer Snippets (Read the full thread at stackoverflow):
Var primeFactors = new int[]{ 2, 2, 3, 5 }; var numFacs = primeFactors.GroupBy(f => f, f => f, (g, s) => s.Count() + 1) .Aggregate(1, (x, y) => x * y);
Try ... .
If I understand what you're looking to do, you may want to use GroupBy() instead .
|
|
Is there any nice algorithm to find the nearest prime number to a given real number? I only need to search within the first 100 primes or so.
At present, I've a bunch of prime numbers stored in an array and I'm checking the difference one number at a ...
Started by Marty on
, 10 posts
by 10 people.
Answer Snippets (Read the full thread at stackoverflow):
The 100th prime number create an ....
This will either get you to one prime number, or a spot between two, and you check which of those of the table, use linear interpolation to guess at a more accurate starting point.
Search.
|
Ask your Facebook Friends
|
How can I find prime numbers through bit operations in C++?
Started by Sirish Kumar on
, 5 posts
by 5 people.
Answer Snippets (Read the full thread at stackoverflow):
I found this c# code, I am sure you can know." Explain how you know what a prime number is, explain some properties of prime numbers of that number....
One bit is sufficient for that.
number is a prime or not.
|
|
The question is to find the 1000th prime number. I wrote the following python code for this. The problem is, I get the right answer for the 10th , 20th prime but after that each increment of 10 leaves me one off the mark. I can't catch the bug here :(...
Started by gsin on
, 10 posts
by 10 people.
Answer Snippets (Read the full thread at stackoverflow):
However, when you find a prime (candidate%x == 0), you're only incrementing the candidate); if(a==1){ k++; }
And a function I've used not so long ago to determine the nth prime number, where "for each number....
By that number".
|
|
How can I display the prime numbers between 1 and 100 in c#?
Started by Sudhakar K on
, 5 posts
by 5 people.
Answer Snippets (Read the full thread at stackoverflow):
Most efficient code....
For the first 10000 prime numbers? Most elegant way to generate prime numbers Prime number calculation funAssuming you wish to find prime numbers, this is a standard question.
|
|
What will be the best way to find a prime number so that the time complexity is much reduced.
Started by prateek on
, 9 posts
by 9 people.
Answer Snippets (Read the full thread at stackoverflow):
There are two different questions:
1) How to find if a number is a prime number? If you discover prime() { Scanner....
If you have a number and you want to find out if it's prime, that is called.
N / log log n).
|
|
In ML i want to get the prime divisors of a number. How can I do this, I am beginner.
Answer Snippets (Read the full thread at stackoverflow):
There are several general algorithms for finding the prime divisors of an integer: see wikipedia want to work with huge numbers like 5 *) infix 7 quot rem val prime_factors = let fun trial_division p.
|
|
Where can I find a prime number generator in C?
Started by Chris on
, 8 posts
by 8 people.
Answer Snippets (Read the full thread at stackoverflow):
The most "classic" implementation of a prime number generator is the Sieve of Eratosthenes assignment? Hiding pr0n from your little sister? Looking for the first X-digit prime number in the first: I assumed to question to....
|
|
How to create a turing machine of prime number?
Started by surbhi on
, 3 posts
by 3 people.
Answer Snippets (Read the full thread at stackoverflow):
After that it is just a question of implementing the turing code of you choice. .
You could easily write a turing-machine emulator in virtually any programming language .
With a blueprint, a circuit board, some components and an electricity outlet .
|
