Python實現求最大公約數及判斷素數的方法

來源:互聯網
上載者:User
本文執行個體講述了Python實現求最大公約數及判斷素數的方法。分享給大家供大家參考。具體實現方法如下:

#!/usr/bin/env python def showMaxFactor(num):   count = num / 2    while count > 1:     if num % count == 0:       print 'largest factor of %d is %d' % (num, count)       break    #break跳出時會跳出下面的else語句     count -= 1   else:     print num, "is prime" for eachNum in range(10,21):   showMaxFactor(eachNum) 

運行結果如下:

largest factor of 10 is 511 is primelargest factor of 12 is 613 is primelargest factor of 14 is 7largest factor of 15 is 5largest factor of 16 is 817 is primelargest factor of 18 is 919 is primelargest factor of 20 is 10

希望本文所述對大家的Python程式設計有所協助。

  • 聯繫我們

    該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

    如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

    A Free Trial That Lets You Build Big!

    Start building with 50+ products and up to 12 months usage for Elastic Compute Service

    • Sales Support

      1 on 1 presale consultation

    • After-Sales Support

      24/7 Technical Support 6 Free Tickets per Quarter Faster Response

    • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.