Difference between revisions of "P-adic valuation"
(Created page with "{{title restriction|<math>p</math>-adic valuation}} For some integer <math>n</math> and prime <math>p</math>, the '''<math>p</math>-adic valuation''' of n, denoted <...") |
(→Basic Examples) |
||
| (One intermediate revision by one other user not shown) | |||
| Line 1: | Line 1: | ||
| + | {{DISPLAYTITLE:''p''-adic valuation}} | ||
{{title restriction|<math>p</math>-adic valuation}} | {{title restriction|<math>p</math>-adic valuation}} | ||
| Line 5: | Line 6: | ||
== Basic Examples == | == Basic Examples == | ||
#<math>\nu_3(18)=\nu_3(2\cdot3^2)=2</math>. | #<math>\nu_3(18)=\nu_3(2\cdot3^2)=2</math>. | ||
| − | #<math>\nu_5(-5)=\nu_5(-1\cdot5^1)= | + | #<math>\nu_5(-5)=\nu_5(-1\cdot5^1)=1</math>. |
#<math>\nu_{13}(28)=\nu_{13}(2^2\cdot7\cdot13^0)=0</math>. | #<math>\nu_{13}(28)=\nu_{13}(2^2\cdot7\cdot13^0)=0</math>. | ||
| Line 27: | Line 28: | ||
== See Also == | == See Also == | ||
| − | *[[Lifting the Exponent]] | + | * [[Lifting the Exponent]] |
| − | *[[Legendre's Formula]] | + | * [[Legendre's Formula]] |
| − | *[[p-adic number]] | + | * [[p-adic number]] |
| + | |||
[[Category: Number theory]] | [[Category: Number theory]] | ||
| + | [[Category:Definition]] | ||
| + | {{stub}} | ||
Latest revision as of 23:05, 1 October 2025
- The title of this article has been capitalized due to technical restrictions. The correct title should be
-adic valuation.
For some integer
and prime
, the
-adic valuation of n, denoted
, represents the largest power of
which divides
. In other words, it is the value of the exponent of
in the prime factorization of
.
Basic Examples
.
.
.
Properties
- For positive integers
and
,
This property follows from the fact that
. - Furthermore,
This follows because we can factor out
copies of
from the sum
. Note that equality holds if
, because, in this case, after factoring out
copies of
from the sum
, the remaining factor cannot be congruent to
modulo
, because one of the terms will be congruent to
, while the other will not (because all common factors of
have already been factored out). - If
is a positive integer, because
, we deduce that
because logarithms are monotone increasing for all bases greater than
, which includes all primes. - Lifting the Exponent: A series of identities, among which the most prominent is:
for odd primes
if
. - Legendre's Formula:
.
Extension to Rational Numbers
is defined to be infinite.
Furthermore, as seen in the properties above,
From this inspiration, we can define fractional inputs as follows:
Note that it does not matter if
is simplified or not, because
\begin{align*}
\nu_p\left(\frac{kx}{ky}\right) &= \nu_p(kx)-\nu_p(ky) \\
&= (\nu_p(k)+\nu_p(x))-(\nu_p(k)+\nu_p(y)) \\
&=\nu_p(x)-\nu_p(y) \\
&=\nu_p\left(\frac xy\right).
\end{align*}
See Also
This article is a stub. Help us out by expanding it.
.