Regeln zur Bestimmung des Zeichens in der Kongruenz \(1\cdot 2\cdot 3\ldots\dfrac{p-1}{2}\equiv \pm 1\) (mod. \(p\)), wo \(p\equiv 3\) (mod. 4) eine Primzahl ist. (Q1462383): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import240304020342 (talk | contribs)
Set profile property.
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:27, 5 March 2024

scientific article
Language Label Description Also known as
English
Regeln zur Bestimmung des Zeichens in der Kongruenz \(1\cdot 2\cdot 3\ldots\dfrac{p-1}{2}\equiv \pm 1\) (mod. \(p\)), wo \(p\equiv 3\) (mod. 4) eine Primzahl ist.
scientific article

    Statements

    Regeln zur Bestimmung des Zeichens in der Kongruenz \(1\cdot 2\cdot 3\ldots\dfrac{p-1}{2}\equiv \pm 1\) (mod. \(p\)), wo \(p\equiv 3\) (mod. 4) eine Primzahl ist. (English)
    0 references
    0 references
    1915
    0 references
    Der Verf. gibt einige neue Regeln, welche den bekannten Kroneckerschen Regeln analog sind.
    0 references
    0 references