Solving Project Euler #3 with OpenAI Codex
227
Publicado 2021-08-25
Todos los comentarios (3)
-
You were on the right track with fixing the first attempt - it was failing any time the largest prime factor was repeated (e.g.: 18 = 2 * 3 * 3), as it would reduce n all the way down to 1, rather than the remaining factor.
-
Hi. nice vid. Could you make something in 3d using codex which generates python code for Blender?
