{"entities":{"Q1550776":{"pageid":1561516,"ns":120,"title":"Item:Q1550776","lastrevid":73741584,"modified":"2026-04-14T17:06:43Z","type":"item","id":"Q1550776","labels":{"en":{"language":"en","value":"Proof of the reciprocity problem."}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 2709391"}},"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":"Q1550776$920324C8-D130-4481-AA60-1C8FCE9DE750","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"6a18157805d60da3aee8849535ee78a29dc9bc12","datavalue":{"value":{"text":"Proof of the reciprocity problem.","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1550776$CACE8459-7C67-4E53-936E-920DC5481B9D","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"66e30f73c00c83b02febf3f7bde1474a4161d4f8","datavalue":{"value":"11.0131.01","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1550776$98846E37-7DF0-4E18-97AA-CA05A40D5B42","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"4b7b4eb67db978b1672b365aeb813fa926070e45","datavalue":{"value":{"entity-type":"item","numeric-id":1511272,"id":"Q1511272"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1550776$8B358AE5-11E3-4546-BAA8-64653EC2E25A","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"467d2fa163657a672b835565680a06f5295571c6","datavalue":{"value":{"entity-type":"item","numeric-id":1547335,"id":"Q1547335"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1550776$EB511645-46B6-45A3-9AB8-B491C7A0C3F9","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"9cc099e55b9a178451ee5c1589c91866f6b6868b","datavalue":{"value":{"time":"+1879-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":"Q1550776$5B9CD12C-6184-4C44-86D1-B2A6D5CE78BE","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"a0cff4d24d4664356b6209168632141d02ff5262","datavalue":{"value":"Ein neuer Beweis des erweiterten Reciprocit\u00e4tssatzes, welcher an Einfachheit und Nat\u00fcrlichkeit gewiss alle bisher bekannten \u00fcbertrifft. Es seien \\(a\\) und \\(b\\) ungerade relative Primzahlen und \\(b>a\\). Die Zahlen \\(a, 3a, 5a\\dots (b-2)a\\) geben dann bei der Division mit \\(b\\) als Reste alle ungraden Zahlen \\(<b\\), aber mit verschiedenen Vorzeichen, und es ist \\(\\left(\\frac{a}{b}\\right)=\\pm 1\\), je nachdem die Anzahl der negativen Reste grade oder ungrade ist. Von diesen Resten werden diejenigen, welche kleiner als \\(a\\) sind, eben \\(\\left(\\frac{b}{a}\\right)\\) bestimmen. Man hat also nur zu untersuchen, wie viele negative Reste sich unter denjenigen befinden, deren numerische Werthe zwischen \\(a\\) und \\(b\\) liegen. Die gesuchte Anzahl ergiebt sich ohne Schwierigkeit als gleich der Anzahl von Gliedern in der Reihe  \\[ \\frac{b}{\\alpha},\\;\\frac{2b}{\\alpha},\\;\\frac{3b}{\\alpha}\\cdots \\frac{(\\alpha-1)b}{\\alpha}\\,,\\quad \\left(\\alpha=\\frac{b- a}{2}\\right), \\]  deren n\u00e4chste kleinere ganze Zahl ungrade ist. Da diese Anzahl sich leicht bestimmen l\u00e4sst, erh\u00e4lt man hieraus den Satz bewiesen f\u00fcr ungrade \\(a\\) und \\(b\\). Der Fall, wo eine dieser Zahlen grade ist, reducirt sich auf die Untersuchung von \\(\\left(\\frac{2}{\\alpha}\\right)\\), was sich bei Betrachtung der Reste von 1.2, 3.2, 5.2 sofort bewerkstelligen l\u00e4sst.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1550776$2BA805F1-613D-4E5A-A80F-045665C60E78","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"0614cfe757af775354cacad4d1852bd334b9e455","datavalue":{"value":"11A15","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1550776$CD378F55-50E3-4620-A7B7-596B6AD620C7","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"660f067fc515caf61b15eb63dba077fe395e8b71","datavalue":{"value":"2709391","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1550776$8F3814E7-E143-4865-AA4B-E2EBD48D6414","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"dd2a9a133a09d6d269f282033730192967c9b6a6","datavalue":{"value":"quadratic reciprocity law","type":"string"},"datatype":"string"},"type":"statement","id":"Q1550776$1E0D669D-DE88-4FF0-98D2-3D7608AEB1B3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"553c6d077c45a8a4b15c7d4eacb6f74b51be5639","datavalue":{"value":"Jacobi symbol","type":"string"},"datatype":"string"},"type":"statement","id":"Q1550776$1557867E-21BD-4736-8A71-24CBFA01AFEE","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":"Q1550776$7538B07A-0D77-4A65-9879-AB096344F3FF","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Proof of the reciprocity problem.","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Proof_of_the_reciprocity_problem."}}}}}