P-Adic Valuation Calculator

v_p(n) = max{k : p^k | n}

CalculatorsFreeNo Signup
4.9(702 reviews)
All Tools

Loading tool...

About P-Adic Valuation Calculator

A p-adic valuation calculator computing v_p(n) = the largest power of prime p dividing n. Also computes |n|_p = p^{−v_p(n)}. Foundation for p-adic numbers and ultrametric geometry. Shows the prime factorization context. Client-side.

P-Adic Valuation Calculator Features

  • v_p(n) computation
  • p-adic norm
  • Factorization
  • Multi-prime
  • Ultrametric
p-adic valuation v_p(n): highest power of p dividing n. v_2(12)=2 (12=2²·3). v_3(12)=1. v_5(12)=0. The p-adic absolute value |n|_p = p^{−v_p(n)} gives an 'ultrametric' where nearby means 'divisible by high powers of p'.

How to Use

Enter n and prime p:

  • v_p(n): Valuation
  • |n|_p: p-adic norm
  • Factorization: Context

Ultrametric

p-adic distance satisfies |a+b|_p ≤ max(|a|_p, |b|_p) — the 'ultrametric inequality'. This is STRONGER than the triangle inequality. It means every triangle is isosceles! Numbers 'close' p-adically share high powers of p.

Applications

  • Number theory: local-global principle
  • Cryptography: p-adic methods in lattice cryptography
  • Physics: p-adic string theory
  • Computer science: 2-adic arithmetic for binary

Step-by-Step Instructions

  1. 1Enter number n.
  2. 2Enter prime p.
  3. 3Compute v_p(n).
  4. 4Get p-adic norm.
  5. 5See factorization.

P-Adic Valuation Calculator — Frequently Asked Questions

What does p-adic 'closeness' mean?+

Two numbers are p-adically close if their difference is divisible by a HIGH power of p. So 1 and 1,000,001 are 2-adically close (difference=10⁶=2⁶·..., v_2=6). This is the 'opposite' of real closeness.

What are p-adic numbers?+

Completing Q with respect to |·|_p gives Q_p (p-adic numbers). Like reals complete Q with |·|, p-adics complete Q with |·|_p. Every number has a unique p-adic expansion: ...a₂a₁a₀.a₋₁a₋₂... (infinite to the LEFT!).

Why do they matter?+

Hasse's local-global principle: many equations can be solved over Q iff solvable over R AND all Q_p. This reduces global number theory to local (one prime at a time) analysis. Incredibly powerful!

Share this tool: