Python solution to project euler problem 5 from here https://projecteuler.net/problem=5
This one requires a bit more mathematical understanding. Here we find the prime factors of all numbers from 2 to 20. We then take the frequency count of each of those primes and keep the highest frequency count. For instance the number 16 has 2 as its prime factor, and that 2 occurs 4 times. So the frequency count for it would be 4. Likewise the frequency count for 3 would be 2 (3*3 = 9) And the other primes of 5,7,11,13,17 that are less than 20 all appear once.
So the solution ends up being 2^4 * 3^2 * 5 * 7 * 11 * 13 * 17
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...