MTNCOMP | List | Table## myBlog |

View Count: 835, Keywords: Euler Project, Programming Languages, Python Programming, Mathematical Exercises, Hashtags: #EulerProject #ProgrammingLanguages #PythonProgramming #MathematicalExercises

I was updating my Spyder 4 to Spyder 5 (Anaconda) platform and realized, I want to try some new mathematical exercises using Python.

Caveat: many of these problems can be solved using lots of different languages; Fortran, C, C++, C#, Java, JavaScript, SQL, Go, Rust, and yes just as important "Python". Some of them one can even use Excel to solve rather quickly. I did.

What are some good exercises and where can I find them. So a quick google, and StackOverFlow gave me some good ideas that led me to Project Euler. I suggest going to the Archives link to go through a few and wrap your head around some of the math and use Python to solve them.

Enjoy!

For example:

The problems archives table shows problems 1 to 748. If you
would like to tackle the 10 most recently published problems then go to Recent problems.

Click the description/title of the problem to view details and submit your answer.

ID |
Description / Title | Solved By |
---|---|---|

1 | Multiples of 3 and 5 |
966497 |

2 | Even Fibonacci numbers |
770211 |

3 | Largest prime factor |
553155 |

4 | Largest palindrome product |
489114 |

5 | Smallest multiple |
492556 |

6 | Sum square difference |
495607 |

7 | 10001st prime |
423903 |

8 | Largest product in a series |
354733 |

9 | Special Pythagorean triplet |
359950 |

10 | Summation of primes |
329606 |

11 | Largest product in a grid |
236050 |

12 | Highly divisible triangular number |
222715 |

13 | Large sum |
227976 |

14 | Longest Collatz sequence |
228273 |

15 | Lattice paths |
188160 |

16 | Power digit sum |
230611 |

17 | Number letter counts |
152488 |

18 | Maximum path sum I |
145911 |

19 | Counting Sundays |
135553 |

20 | Factorial digit sum |
199509 |

more to come...

© 2022 myBlog™ v1.1 All rights reserved. We count views as reads, so let's not over think it.