{"entities":{"Q6901020":{"pageid":20904886,"ns":120,"title":"Item:Q6901020","lastrevid":75524347,"modified":"2026-04-19T08:48:46Z","type":"item","id":"Q6901020","labels":{"en":{"language":"en","value":"Around the GCD of the Values of Two Polynomials"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8120299"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6901020$F3F322A3-45F9-41EE-A6B6-4B025D488377","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"3f2f490140a5fd657082015e17145a897ec81c46","datavalue":{"value":{"text":"Around the GCD of the Values of Two Polynomials","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6901020$46E3824B-3926-4611-9F55-1708DCD1305A","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"8d775a44e7648e13c5c6740f6f47503b6240843f","datavalue":{"value":"10.1080/00029890.2025.2525048","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6901020$6B2A1BA4-DEAA-47FC-A2DF-1CADEDAE4593","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"e997c69c78f2839c0d7273f4c5265ada4ffc4fc7","datavalue":{"value":{"entity-type":"item","numeric-id":303800,"id":"Q303800"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6901020$1DC14051-8D38-42C8-B3D7-996473CB74CB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"c645689f58e7a49653d375c5ebf85825a7c7c1eb","datavalue":{"value":{"entity-type":"item","numeric-id":2341678,"id":"Q2341678"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6901020$EC59952B-381E-4F32-A93D-E7D2B526C527","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"f5ab0baf7eae70aecb4af413b43b8b6a1ca6194f","datavalue":{"value":{"entity-type":"item","numeric-id":559780,"id":"Q559780"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6901020$52F73557-862E-4325-B5AE-DD0D53B1B678","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"ca40fd8abdd4028001e271b64bec45a65c5b5050","datavalue":{"value":{"time":"+2025-11-12T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6901020$27B10914-139A-4778-B4EB-1B7E45C3919C","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"47d22af2c664791650ccacbb186090d0e64f2783","datavalue":{"value":"Let \\(A(x), B(x)\\in \\mathbb Z[x].\\) For \\(n\\in \\mathbb Z,\\) let \\(G(n)=\\gcd(A(n), B(n)).\\) Let \\(p\\) be a prime. Let \\(N \\wedge p^{\\infty}\\) denote the greatest power \\(p^\\omega\\) dividing \\(N\\) and write \\(v_p(N)=\\omega\\) to represent the valuation of \\(N.\\) In this interesting article, the notion of resultant \\(\\Delta\\) (corresponding to polynomials \\(A(x), B(x)\\)) is used to prove that the sequence \\((G(n))_{n\\in \\mathbb Z}\\) is periodic. Further the vital information connected to its pattern (associated with \\(p)\\) which is precisely the list of elements of the sequence forming a minimal period: \\N\\[\\N\\underline {m}_p=[G(0)\\wedge p^\\infty, G(1)\\wedge p^\\infty,\\ldots, G(p^\\mu-1)\\wedge p^\\infty]_{p^\\mu}\\N\\]\\Nis noteworthy. Theorem 6 in the article explains that if \\(A(x), B(x)\\) are coprime (in \\(\\mathbb Q[x]),\\) then the sequence \\((G(n)\\wedge p^\\infty)_{n\\in \\mathbb Z}\\) is periodic of a period \\(p^{\\omega_p},\\) where \\(\\omega_p=v_p(\\Delta).\\) Also for all \\(n\\in \\mathbb Z, G(n)=\\displaystyle\\prod_{p\\mid \\Delta}\\underline {m}_p(n)\\) and \\((G(n))_{n\\in \\mathbb Z}\\) is periodic with a period dividing \\(\\Delta.\\) Moreover if we take any element \\(\\underline {m}_{p_1}(n_1)\\) of pattern \\(\\underline {m}_{p_1},\\) any element \\(\\underline {m}_{p_2}(n_2)\\) of pattern \\(\\underline {m}_{p_2},\\ldots,\\) then there exists \\(n\\in \\mathbb Z\\) such that \\(G(n)\\) is equal to the product of \\(\\underline {m}_{p_i}(n_i).\\) Some strong constraints on these patterns have also been pointed out. Note that in Theorem 9, if \\(A(x), B(x)\\) are coprime monic polynomials with resultant \\(\\Delta\\) and \\(G(n)=A(n)\\wedge B(n), n\\in \\mathbb Z;\\) then for integers \\(n_1, \\ldots, n_l\\) with \\(l\\leq \\deg(A)+\\deg(B),\\) we have \\N\\[\\N\\prod_{i=1}^{l}G(n_i)|\\Delta\\times\\prod_{1\\leq i