BranchesHistoryHelpLogin
Welcome guest
You're not logged in.
289 users online, thereof 0 logged in

Proposition: Multiplicativity of the Legendre Symbol

Let $p > 2$ be a prime number.

The Legendre symbols are completely multiplicative, i.e. for any two integers $n,m\in\mathbb Z$ we have $$\left(\frac{nm}{p}\right)=\left(\frac{n}{p}\right)\cdot\left(\frac{m}{p}\right).$$

In other words:

Yet in other words:

In general, if $p > 2$, $r\ge 2,$ and $n_1,\ldots,n_r$ are integers, then
$$\left(\frac{n_1\cdots n_r}{p}\right)=\left(\frac{n_1}{p}\right)\cdots\left(\frac{n_r}{p}\right).$$

| | | | | created: 2019-05-15 05:33:13 | modified: 2019-05-26 05:28:24 | by: bookofproofs | references: [1272]

1.Proof: (related to "Multiplicativity of the Legendre Symbol")

Edit or AddNotationAxiomatic Method

This work was contributed under CC BY-SA 3.0 by:

This work is a derivative of:

(none)

Bibliography (further reading)

[1272] Landau, Edmund: “Vorlesungen ├╝ber Zahlentheorie, Aus der Elementaren Zahlentheorie”, S. Hirzel, Leipzig, 1927