Obsolete stuff that will tell you if there is a “Next” page by looking for the string “next” in the HTML. A pretty useless loop… Finally, just a simple “If it’s there then we cool”
This is the original text And this is what you get after deleting everything except digits. More info on Python regular expressions.
Problem 4 from the Project Euler website. The Problem A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 x 99 Find the largest palindrome made from the product of two 3-digit numbers. My Solution First I did 999 x 999 to […]
Problem 3 from the Project Euler website. The Problem The prime factors of 13195 are 5, 7, 13 and 29. What is the largest prime factor of the number 600851475143? My Solution WARING: It’s right…but not efficient at all. Don’t use – your computer will hate you. I’ll come back to this one when I […]
Problem 2 from the Project Euler website. The Problem Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be: 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, … By considering the terms in the Fibonacci sequence […]
My very first Python script Problem 1 from the Project Euler website. The Problem If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23. Find the sum of all the multiples of 3 or 5 […]
Search and place stuff in groups… Macros to get all the links I need from the HTML source
GitHub for Mac