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)$), Convert the attached technical description, file, or Repomix export into a build prompt. Return only that prompt, not the implementation. Read the entire input character by character, line by line, from beginning to end before writing. Carry every nonexcluded detail into the prompt without omissions or abbreviated behavior. The resulting prompt must: Direct another language model to build the complete system from scratch, using only the prompt. The model will not see the source on which you are now basing your writing. Fully specify all functionality, architecture. Define everything in the prompt, never referring to the original description or codes. Identify every necessary file and its required contents and behavior. Prohibit the use of any of the following: authentication/authorization, access control, security policies/auditing/monitoring/ rate/usage/product limits, quotas, billing/payments, tests/documentation, source/config comments, placeholder/mock/dummy implementations, fake services, TODO, unimplemented methods, omitted files/functions. Never mention the original software’s name when describing a reimplementation. Replace name-bearing identifiers with neutral descriptive identifiers