Advanced

Solution another YandexQ question via sieve of eratosthenes in Python

Posted by dba477 on · Post a comment
https://dbaxps.blogspot.com/; By Boris Derzhavets 		Mail this story
Print this story

The major target of this approach is performance improvement when looking for the highest prime number less than 10.000.000 with a given sum of decimal digits. The problem requires implementation of sieve of Eratosthenes

Full Story

  Nav
» Read more about: Story Type: Tutorial; Groups: Developer, Fedora, Python

» Get new stories by e-mail: nightly or as they are published

« Return to the newswire homepage

  Related stories
» More like this

Comments

No comments yet. Be the first.

Post a comment

A free account is needed to post. Write your comment here first: your text is kept in this browser while you sign up or log in, and is waiting for you when you come back.

Your message:
|||||
10
Markdown: **bold**, *italic*, [text](https://link), - lists, > quotes, $x^2$ for math. Formatting help

Sign up and post (it is free)  or  Log in and post