In the post “Sieve of Eratosthenes“, I had posted a Java program for the prime sieve. Translating it to Python, I have: The list of primes generated by this sieve could then be used for…
Posts for: #Python
0x0012 - Fibonacci sequence – Part 2
In this post we’ll compare the various methods of generating Fibonacci sequence terms and implementing the code to recognize Fibonacci terms and to determine index of these terms. These…
0x000a - Project Euler 009
Problem: A Pythagorean triplet is a set of three natural numbers, a < b < c, for which, a2 + b2 = c2 For example, 32 + 42 = 9 + 16 = 25 = 52. There exists exactly one Pythagorean triplet…
0x0009 - Project Euler 008
Problem: Find the greatest product of five consecutive digits in the 1000-digit number. 73167176531330624919225119674426574742355349194934…
0x0008 - Project Euler 007
Problem: By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13. What is the 10,001st prime number? Solution: 1. Brute-force approach: 2.…
0x0007 - Primality Testing
I’ve been doing some programs on Primality tests, and so far, have implemented some naive algorithms. Though not efficient, these are useful for quick implementations. Here I post some…
0x0006 - Project Euler 006
Problem: The sum of the squares of the first ten natural numbers is, 12 + 22 + … + 102 = 385 The square of the sum of the first ten natural numbers is, (1 + 2 + … + 10)2 = 552 = 3025…
0x0005 - Project Euler 005
Problem: 2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder. What is the smallest positive number that is evenly divisible by all…