Path: csiph.com!usenet.pasdenom.info!aioe.org!news.stack.nl!newsfeed.xs4all.nl!newsfeed6.news.xs4all.nl!xs4all!newsgate.cistron.nl!newsgate.news.xs4all.nl!post.news.xs4all.nl!not-for-mail Return-Path: X-Original-To: python-list@python.org Delivered-To: python-list@mail.python.org X-Spam-Status: OK 0.010 X-Spam-Evidence: '*H*': 0.98; '*S*': 0.00; 'assign': 0.07; 'subject:two': 0.07; 'received:80.91': 0.09; 'received:80.91.229': 0.09; 'received:gmane.org': 0.09; 'received:list': 0.09; 'successive': 0.09; 'itself.': 0.11; '"n"': 0.16; '24,': 0.16; 'progression': 0.16; 'received:80.91.229.3': 0.16; 'received:plane.gmane.org': 0.16; 'spacing': 0.16; 'subject:Problems': 0.16; 'subject:questions': 0.16; 'subject:these': 0.16; 'integer': 0.17; '(or': 0.18; 'variable': 0.20; 'elements': 0.23; 'header:X-Complaints-To:1': 0.28; 'arithmetic': 0.29; 'factor': 0.29; 'url:home': 0.33; 'to:addr :python-list': 0.33; 'nov': 0.35; 'same.': 0.35; 'sequence': 0.35; 'so,': 0.35; 'received:org': 0.36; 'but': 0.36; '12,': 0.36; 'charset:us-ascii': 0.36; 'problems': 0.36; 'two': 0.37; 'subject:: ': 0.38; 'positive': 0.38; 'to:addr:python.org': 0.39; 'header:Received:5': 0.40; 'distance': 0.62; 'between': 0.63; 'exceed': 0.65; 'sum': 0.66; 'upper': 0.75; '(based': 0.84; '2.an': 0.84; 'dennis': 0.91; 'received:108': 0.91; 'factors': 0.95 X-Injected-Via-Gmane: http://gmane.org/ To: python-list@python.org From: Dennis Lee Bieber Subject: Re: Problems on these two questions Date: Mon, 19 Nov 2012 18:15:24 -0500 Organization: > Bestiaria Support Staff < References: <400c615f-4d93-4b8b-85ec-1bb4c47e30fe@googlegroups.com> Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit X-Gmane-NNTP-Posting-Host: adsl-108-68-177-195.dsl.klmzmi.sbcglobal.net X-Newsreader: Forte Agent 3.3/32.846 X-No-Archive: YES X-BeenThere: python-list@python.org X-Mailman-Version: 2.1.15 Precedence: list List-Id: General discussion list for the Python programming language List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , Newsgroups: comp.lang.python Message-ID: Lines: 27 NNTP-Posting-Host: 2001:888:2000:d::a6 X-Trace: 1353366936 news.xs4all.nl 6975 [2001:888:2000:d::a6]:49022 X-Complaints-To: abuse@xs4all.nl Xref: csiph.com comp.lang.python:33560 On Sun, 18 Nov 2012 17:52:35 -0800 (PST), su29090 <129km09@gmail.com> declaimed the following in gmane.comp.python.general: > > I all of the other problems but I have issues with these: > > 1.Given a positive integer n , assign True to is_prime if n has no factors other than 1 and itself. (Remember, m is a factor of n if m divides n evenly.) > Google: Sieve of Eratosthenes (might be mis-spelled) > 2.An arithmetic progression is a sequence of numbers in which the distance (or difference) between any two successive numbers if the same. This in the sequence 1, 3, 5, 7, ... , the distance is 2 while in the sequence 6, 12, 18, 24, ... , the distance is 6. > > Given the positive integer distance and the positive integer n , associate the variable sum with the sum of the elements of the arithmetic progression from 1 to n with distance distance . For example, if distance is 2 and n is 10 , then sum would be associated with 26 because 1+3+5+7+9 = 25 . > So, what have you tried? Consider: you have a "sum", you have a sequence of "elements" (based upon a spacing "distance"), and you have an upper bound "n" You need to generate a sequence of "elements" starting at "1", using "distance" as the spacing, until you exceed "n", and you want to produce a "sum" of all those elements... -- Wulfraed Dennis Lee Bieber AF6VN wlfraed@ix.netcom.com HTTP://wlfraed.home.netcom.com/