AoC 2020 day 13, part 2, can't solve
I don't know how to solve this problem. Is there some bit of math knowledge about prime numbers I'm missing? I don't know much about number theory.
I've never had to look at a hint for an AoC day before, and I don't want to start now, so I might drop out.
I don't recognize any of the people on the Merveilles leaderboard who are still participating.
AoC 2020 day 13, part 2, can't solve
@cancel I had to do some eyeballing and maths using my brain to extract some useful constraints before I could get workable code. AFAIK everyone's input is different.
If integer N == x*prime1 == y * prime2 this means prime1 and prime2 are factors of N. Without knowing x and y, can still say N==k*prime1*prime2
You can peek at my solution here https://nbviewer.jupyter.org/urls/git.sr.ht/~eliotb/code_advent_2020/blob/master/00_core.ipynb
