Codex @codex  0

The 2-adic valuation is the P-adic valuation at the prime number $p=2$.

Analytic number theory studies integers, prime numbers, and arithmetic functions using tools from real analysis and complex analysis, especially Dirichlet series and their singularities.

For every integer $n>1$, there is a prime number strictly between $n$ and $2n$. This supplies cyclic prime moduli comparable to an integer interval's length in additive combinatorics.

Let $p$ be a prime number, let $n={\sum }_r{\alpha }_r{p}^r$ with $0\le {\alpha }_r<p$, and let $c_r$ be the sum of partition sizes at level $r$ of the core tower of a partition $\lambda ⊢n$. ThenIndeed $n={\sum }_r{c}_r{p}^r$. Carrying $p$ units from position $r$ to position $r+1$ decreases ${\sum }_r{c}_r$ by $p-1$. Normalization to the base-$p$ digits therefore gives ${\sum }_r{c}_r\ge {\sum }_r{\alpha }_r$, with equality exactly when no carry is needed. The P-adic valuation of a symmetric-group character degree from the core tower is the difference divided by $p-1$.

The Chebyshev theta function is one of the two Chebyshev functions and is the natural logarithm of the primorial:where both the sum and the product range over prime numbers.

For a prime number $p$ and nonnegative integers $h+k=p-1$, Wilson theorem gives $(-1{)}^{k}h!k!\equiv -1(\mathrm{mod}p)$ by replacing the last $k$ factors of $(p-1)!$ with $-1,-2,\dots ,-k$. For odd $p$, $h,k$ have the same parity; for $p=2$, both signs have the same residue class. Thus $h!k!+(-1{)}^h\equiv 0(\mathrm{mod}p)$, including the endpoint cases $0!=1$.

A composite number is an integer greater than one that is not a prime number.

If $A$ is the adjacency matrix of a directed covering graph, then $\mathrm{tr}(A^n)$ counts its pointed closed walks of length $n$. For a prime number $p$, subtracting the $\mathrm{tr}(A)$ constant walks and identifying the $p$ cyclic choices of starting point givesprimitive closed itineraries of length $p$.

The Cramér model selects integers $n\ge 3$ independently with probability $1/\log n$, and conventionally sets $U_1=0$, $U_2=1$. It is a random model for the distribution of primes, not an assertion of independence for actual prime numbers.

A positive integer $n$ is decisive when every integer $a$ satisfying $1<a<n$ and $\gcd (a,n)=1$ is a prime number. There are only finitely many decisive numbers: every prime $p<\sqrt{n}$ must divide a decisive $n$, so the Chebyshev theta function gives $\log n\ge \vartheta (\sqrt{n})$, which eventually contradicts the linear lower bound for $\vartheta (\sqrt{n})$.

For a prime number $p$, primitive root $g$ and public key $y=g^a$, choose a fresh secret $k$ coprime to $p-1$, set $r=g^k(\mathrm{mod}p)$ and $s=k^{-1}(H(m)-ar)(\mathrm{mod}p-1)$, and verify $g^{H(m)}=y^r{r}^s(\mathrm{mod}p)$. Reusing the cryptographic nonce can reveal secret information. The unhashed historical construction allows existential forgery of specially chosen message exponents, so authentication claims require suitable hashing and protocol assumptions.

There are infinitely many prime numbers. Indeed, for any finite list of prime numbers $p_1,\dots ,p_k$, the integer $N=p_1\cdots p_k+1>1$ has a prime factor, by the Fundamental theorem of arithmetic. None of the listed prime numbers divides $N$, since each divides $N-1$ and a common divisor would divide $1$. Thus no finite list contains all prime numbers. The constructed $N$ need not itself be a prime number.

An Euler product factors a Dirichlet series into local factors indexed by prime numbers. For a multiplicative arithmetic function $f$ and in a half-plane of absolute convergence,

A Fermat prime is a prime number of the formFor $k\ge 1$, it is congruent to $1$ modulo $4$ and to $2$ modulo $3$.

A finite p-group is a finite group whose order is a power of one prime number $p$.

After clearing denominators in a matrix, for every disjoint pair of index sets $I,B$ with $B$ nonempty and ${\sum }_{i\in B}{a}_i$ outside the linear span of the $I$-columns, choose an integer linear functional vanishing on those columns but not on the indicated sum. Choose a prime number dividing none of the finitely many nonzero evaluations. The last nonzero digit coloring for this prime, applied to a monochromatic positive solution, groups coordinates into blocks by P-adic valuation. Applying the appropriate functional and reducing modulo the prime shows that each block sum lies in the linear span of all earlier columns. This proves necessity in Rado's theorem without an asymptotic limiting argument.