{"entities":{"Q2544235":{"pageid":2554978,"ns":120,"title":"Item:Q2544235","lastrevid":73787691,"modified":"2026-04-14T17:15:52Z","type":"item","id":"Q2544235","labels":{"en":{"language":"en","value":"R\u00e9solution en nombres entiers de l'\u00e9quation diophantienne \\(n(n+1)=2n'(n'+1)\\)"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3335210"}},"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":"Q2544235$4AC99D60-984C-4C6F-9FD9-88D4AAF636DC","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"a5031579ef03a1bd757f15139d85bca9376639dc","datavalue":{"value":{"text":"R\u00e9solution en nombres entiers de l'\u00e9quation diophantienne \\(n(n+1)=2n'(n'+1)\\)","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2544235$E3D92949-A50D-4483-A99A-9FA61FBE9723","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"bf3148fc317db399509e90c47d1b6ae50e58c553","datavalue":{"value":"0211.37402","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2544235$01B3E72E-2871-4B83-AF3D-287F4FC156D9","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"099cc4964cfe6331c8c0d78394f51333d0c7c61c","datavalue":{"value":{"entity-type":"item","numeric-id":2526778,"id":"Q2526778"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2544235$4BD5FDB6-5463-4A44-B804-7B0DDCEBC5E9","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"190f08128b991df2a0ad2bbf0d84e95f751f56d1","datavalue":{"value":{"entity-type":"item","numeric-id":246266,"id":"Q246266"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2544235$3129118D-6B5D-4854-8E12-47F5B06CDC1D","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"e293d9e9c8dba13b0feb4b9b16887fc748f70c6f","datavalue":{"value":{"time":"+1970-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q2544235$2BD3DD51-BF36-4A97-B911-8BE96B34CB44","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"26ac998eabb91dd0efc288354a2b07883f21d9df","datavalue":{"value":"Il s'agit d'une voie nouvelle pour atteindre un r\u00e9sultat d\u00e9j\u00e0 connu, celui d'\u00e9tablir: les solutions \\((n, n')\\) de l'\u00e9quation   \\[ n(n + 1) = 2n' (n' + 1). \\tag{1} \\]   On \u00e9tablit d'abord que les quatre nombres \\(n\\), \\(n+1\\), \\(n'\\) et \\(n'+1\\) sont n\u00e9cessairement compos\u00e9s et qu'aucun d'entre eux ne peut en diviser un autre, sauf dans le cas de \\((n=3,\\ n' =2)\\) (2). Posant alors \\(n' =ab\\), \\(n'+1 = \\alpha\\beta\\), on d\u00e9finit des conditions que doivent remplir \\(a, b, \\alpha, \\beta\\) pour que \\((n,n')\\) soit une solution de (1) dans l'une ou l'autre des deux seules \u00e9ventualit\u00e9s possibles    \\[ E_1: [n=2a\\alpha,\\ n+1 =b\\beta]\\quad\\text{et}\\quad E_2: [n=a\\alpha,\\ n+1 =2b\\beta]. \\]   On \u00e9tablit ensuite les formules de r\u00e9currence, ici appel\u00e9es \\(F_1, F_2\\), convenant \u00e0 \\(E_1\\) et \\(E_2\\) pour d\u00e9duire d'une solution \\((n,n')\\) et en particulier de la solution \\((3,2)\\) une double infinit\u00e9 d'autres.   On montre enfin qu'aucune solution de (1) ne peut exister en dehors de celles qui sont ainsi d\u00e9duites de \\((3,2)\\). Pour cela, on part de l'existence suppos\u00e9e d'une solution \\((n = n')\\) de (1) et on lui applique \u00e0 rebours les formules de r\u00e9currence \\(F_1, F_2\\) en consid\u00e8rant, selon le cas, les diviseurs impairs \\(a\\) et \\(\\alpha\\) de \\(n\\) \\((E_1)\\) ou \\(b\\) et \\(\\beta\\) de \\(n+1\\) \\((E_2)\\). De deux choses l'une, nouvelle solution \\((n_1 <n;\\ n'_1)\\) dans laquelle \\(n_1 = (a -1)/2\\) si \\(a\\) est impair et \\(n_1 = (b -1)/2\\) si \\(a\\) est pair, ou l'on aboutit \u00e0 une contradiction avec des r\u00e9sultats d\u00e9j\u00e0 connus et n\u00e9cesaires, en particulier la condition de non-primalit\u00e9 \u00e9nonc\u00e9e au deuxi\u00e8me alin\u00e0 ci-dessus. Il n'est pas n\u00e9cessaire d'identifier \\(n'_1\\) et on peut op\u00e8re sur \\((n_1,n'_1)\\) comme on l'a fait sur \\((n,n')\\). On construit alors facilement par ce proc\u00e9d\u00e9, conduisant \u00e0 une double descente infinie, un ``arbre'' de d\u00e9cisions dont les branches aboutissent soit \u00e0 des contradictions, soit \u00e9ventuellement au seul nombre premier admissible, \\(3\\). D\u00e8s lors, \\(n\\) figure n\u00e9cessairement dans un couple \\((n, n'')\\) d\u00e9duit de \\((3,2)\\) par \\(F_1, F_2\\). Or, si \\(n\\) figure dans une solution \\((n, n')\\) de (1), \\(n'\\) ne peut avoir qu'une et une seule, valeur. On a donc \\((n, n' ) = (n, n'')\\).","type":"string"},"datatype":"string"},"type":"statement","id":"Q2544235$35629310-C47F-4B0F-8D32-7EBFC632CB38","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"805302a557989b683fb14360a2e7b8b6f804b270","datavalue":{"value":"11D09","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2544235$0F89C436-95E9-49B8-A3C6-178740F611AE","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"a4f830a49372f99e8c33b97fe5e4ec14afb3d9c7","datavalue":{"value":"3335210","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2544235$99EFDDE0-B1F2-45DB-8618-EFCBBC22CE17","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"d1e0e80124002d8aeab7c02412a785c46b6a2a18","datavalue":{"value":"quadratic Diophantine equation","type":"string"},"datatype":"string"},"type":"statement","id":"Q2544235$0D34B244-6D02-43C9-9CB2-36717C8CAFE8","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2544235$D1F6B401-EDA5-468E-95F8-17652AFAAC01","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"R\u00e9solution en nombres entiers de l'\u00e9quation diophantienne \\(n(n+1)=2n'(n'+1)\\)","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/R%C3%A9solution_en_nombres_entiers_de_l%27%C3%A9quation_diophantienne_%5C(n(n%2B1)%3D2n%27(n%27%2B1)%5C)"}}}}}