User:Proz/sandbox

This is the user sandbox of Proz. A user sandbox is a subpage of the user's user page. It serves as a testing spot and page development space for the user and is not an encyclopedia article. Create or edit your own sandbox here.

Other sandboxes: Main sandbox | Template sandbox

Finished writing a draft article? Are you ready to request review of it by an experienced editor for possible inclusion in Wikipedia? Submit your draft for review!

$λ(m \times n)$ = $ppcm(λ(m), λ(n))$ si m et n premiers entre eux.

Proposition. — la fonction $λ$ est définie par

$λ(p r) = p r - p r - 1$ , pour p premier impair et r > 0, ou p = 2 et 0 < r ≤ 2 ;
$λ(2 r) = 2 r - 2$ , pour r > 2 ;
$λ(p 1 r 1 ... p k r k)$ = $ppcm(λ(p 1 r 1), ... , λ(p k r k))$ .

u→ $u \to$ $u$ $AB \to$ $AB$ $A B \to$ →u →u ----A→B $\to u — A \to B$

$.mw-parser-output .sfrac{white-space:nowrap}.mw-parser-output .sfrac.tion,.mw-parser-output .sfrac .tion{display:inline-block;vertical-align:-0.5em;font-size:85%;text-align:center}.mw-parser-output .sfrac .num{display:block;line-height:1em;margin:0.0em 0.1em;border-bottom:1px solid}.mw-parser-output .sfrac .den{display:block;line-height:1em;margin:0.1em 0.1em}.mw-parser-output .sr-only{border:0;clip:rect(0,0,0,0);clip-path:polygon(0px 0px,0px 0px,0px 0px);height:1px;margin:-1px;overflow:hidden;padding:0;position:absolute;width:1px}⁠ln(m)/2×4k⁠$ .

$a λ(n) + 1 \equiv a mod n$ : $a λ(n) + 1 = a mod n$ : $= \equiv$