actually i just added up all the numbers and they sum to 2024 so something is still wrong
my idea was to write a function longest_prime_sum(n) that returns the length of the longest sum of distinct primes adding up to n.
Then calculate:
longest_prime_sum(2)
longest_prime_sum(3)
longest_prime_sum(4)
...
longest_prime_sum(2025)
in order, and keep a global cache where cache[i] is the set of primes that sum to i
and if you do it that way it's fast (even though it's recursive), but i fucked something up so it doesn't sum to 2025 haha
https://t.co/4FThRYhxaO