Python solution to project euler problem 3 from here https://projecteuler.net/problem=3
For this we need two functions, one to find the a list of primes using a prime sieve, and one to find the prime factors of the number using that list. We should make those functions into libraries because Primes are used all the time in project Euler.
The code shown here works for this problem, but I found out in a later problem that it doesn't get the correct prime factors for prime numbers or perfect squares, so it needed a few tweaks.
All code
Copyright 2021 Google LLC
SPDX-License-Identifier: Apache-2.0
https://www.apache.org/licenses/LICEN...
The Snake image in the thumbnail - by Vecteezy https://www.vecteezy.com/vector-art/4...
On this page of the site you can watch the video online Project Euler #3 In Python with a duration of hours minute second in good quality, which was uploaded by the user Dubious Code 29 March 2021, share the link with friends and acquaintances, this video has already been watched 147 times on youtube and it was liked by 1 viewers. Enjoy your viewing!