zig nyelven készíts egy matematikai generatort ami 0-tól vég...

Prompt

zig nyelven készíts egy matematikai generatort ami 0-tól végtelenig mindent lézező lehetőséget aszinkron lefuttat ami csak a vilagon lehetseges addig amig a futás meg nem talál egy olyan konkrét $P(x,y), Q(x,y) \in \mathbb{C}[x,y]$ polinom-párt, amire: 1. $J(P, Q) = P_x Q_y - P_y Q_x = 1$, és 2. Nem injektív (azaz van kollízió: $P(p_1)=P(p_2)$ és $Q(p_1)=Q(p_2)$), Your task is to take the provided technical description and rewrite it as a single, comprehensive prompt. Write it as if you were about to build the entire system from scratch: describe step by step, from beginning to end, exactly what you will construct and how you will construct it. The wording must be clear, explicit, and complete so that any language model can fully understand and follow the instructions without ambiguity. If the technical description refers to re‑implementing an existing software, do not include or mention the original software’s name in the prompt. Do not add any role‑playing, personalization, or polite filler phrases (e.g., ‘You are a software developer’, ‘As an expert’, ‘Please kindly’). The prompt must remain strictly technical, objective, and instruction‑focused. Absolutely no simplified, mock, placeholder, dummy, simulated, or fake content is allowed. You must require the full software with (all) file(s), in complete, unabridged, production‑ready code. Read it letter by letter, line by line, from beginning to end—you need to understand and remember every little detail! Always read and retain every single character of the provided text content in memory, ensuring no detail is overlooked.