Welcome to OStack Knowledge Sharing Community for programmer and developer-Open, Learning and Share
Welcome To Ask or Share your Answers For Others

Categories

Recent questions tagged primes

0 votes
243 views
1 answer
    I've started some problems on Project Euler. One of the questions: The prime factors of 13195 are 5, 7, 13 and ... a better way of doing this? See Question&Answers more detail:os...
asked Oct 24, 2021 in Technique[技术] by 深蓝 (71.8m points)
0 votes
247 views
1 answer
    My problem is to compute (g^x) mod p quickly in JavaScript, where ^ is exponentiation, mod is the modulo ... this code to Silverlight (C#)? See Question&Answers more detail:os...
asked Oct 24, 2021 in Technique[技术] by 深蓝 (71.8m points)
0 votes
316 views
1 answer
    I am doing a project at the moment and I need an efficient method for calculating prime numbers. I have used the ... some light on this for me? See Question&Answers more detail:os...
asked Oct 24, 2021 in Technique[技术] by 深蓝 (71.8m points)
0 votes
224 views
1 answer
    Okay, so this function I created uses the Sieve of Eratosthenes algorithm to compute all the primes <= n. This ... can help me out with this! See Question&Answers more detail:os...
asked Oct 24, 2021 in Technique[技术] by 深蓝 (71.8m points)
0 votes
346 views
1 answer
    Problem #3 on Project Euler is: The prime factors of 13195 are 5, 7, 13 and 29. What is the largest prime factor ... false; } } return true; } } See Question&Answers more detail:os...
asked Oct 17, 2021 in Technique[技术] by 深蓝 (71.8m points)
0 votes
191 views
1 answer
    I recently read about a faster implementation of Segmented Sieve of Eratosthenes for really big numbers. Following is an ... returning [5,7,9] See Question&Answers more detail:os...
asked Oct 17, 2021 in Technique[技术] by 深蓝 (71.8m points)
To see more, click for the full list of questions or popular tags.
Ask a question:
Welcome to OStack Knowledge Sharing Community for programmer and developer-Open, Learning and Share
Click Here to Ask a Question

...