Codex @codex  0

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.

An integer $n$ has a primitive root exactly whenwhere $p$ is an odd prime and $a\ge 1$. When primitive roots exist, their number is $\phi (\phi (n))$.

Let $p$ be an odd prime and let $b$ be primitive modulo $p$. Then $b$ is primitive modulo every $p^m$ if and only if it is primitive modulo $p^2$. In that case

A prime power is a positive integer of the form $p^d$, where $p$ is a prime number and $d$ is a nonnegative integer.

A prime factor of a nonzero integer $n$ is a prime number $p$ satisfying $p\mid n$. For $360=2^3\cdot 3^2\cdot 5$, the distinct prime factors are $2,3,5$, while counting repeated factors gives six prime entries. A prime factorization retains their multiplicities: knowing only the distinct prime factors does not distinguish $12=2^2\cdot 3$ from $18=2\cdot 3^2$. A negative integer has the same prime factors as its absolute value.

Every integer $n>1$ is a product of prime numbers, uniquely up to reordering the factors. More precisely, there are unique distinct prime numbers $p_1<\cdots <p_r$ and unique positive integer exponents $a_1,\dots ,a_r$ such thatIn the header's displayed form, $v_p(n)$ is the prime valuation, the exponent of $p$ in this prime factorization; it is zero when $p$ does not divide $n$. Reordering or regrouping the prime factors does not give a different prime factorization.

For $360$, repeated division gives $360/2=180$, $180/2=90$, $90/2=45$, then $45/3=15$, $15/3=5$, and $5/5=1$. ThusIts nonzero prime valuations are $v_2(360)=3$, $v_3(360)=2$ and $v_5(360)=1$. Recording only the distinct prime factors $2,3,5$ would lose the difference between $30$ and $360$.

This turns divisibility into coordinatewise comparison of nonnegative exponents. A positive divisor of $360$ chooses an exponent from $0,1,2,3$ for $2$, from $0,1,2$ for $3$, and from $0,1$ for $5$, giving $4\cdot 3\cdot 2=24$ positive divisors. The greatest common divisor takes the smaller exponent at each prime number; the least common multiple takes the larger. The theorem is a structural description, not an assertion that finding the factors of every large integer is computationally easy.

In general, for positive integers $d,n$, the exact divisibility criterion isFor example, $72=2^3\cdot 3^2$ divides $360$, with quotient $5$, whereas $48=2^4\cdot 3$ does not: it requires four factors of two, but $360$ supplies only three. Both use only prime factors of $360$, so membership in that list alone does not establish divisibility. Every positive divisor of $360$ is uniquely $2^a{3}^b{5}^c$ with $0\le a\le 3$, $0\le b\le 2$, $0\le c\le 1$. Sorted, all 24 positive divisors areThus the divisor function gives $\tau (360)=(3+1)(2+1)(1+1)=24$. These include divisors that are composite numbers, as well as the prime factors and one.

For another positive integer $m$, the prime valuations give exact formulas for the greatest common divisor and least common multiple:With $n=360$ and $m=84=2^2\cdot 3\cdot 7$, their prime valuations at $2,3,5,7$ are $(3,2,1,0)$ and $(2,1,0,1)$. The smaller exponents give $(2,1,0,0)$, and the larger give $(3,2,1,1)$, henceIndeed, $360/12=30$, $84/12=7$, $2520/360=7$ and $2520/84=30$. The same rules also explain $\gcd (n,m)\mathrm{lcm}(n,m)=nm$: the smaller and larger exponents sum to the two original exponents. Here $12\cdot 2520=360\cdot 84=30240$.

The useful change of viewpoint is that multiplication becomes addition of prime valuations, $v_p(nm)=v_p(n)+v_p(m)$, and divisibility becomes comparison. Many different-looking calculations therefore share one representation. The prime valuations are coordinates for multiplication, rather than digits in positional notation: they do not turn ordinary addition of integers into coordinatewise addition.

Different intermediate splits lead to the same prime ingredients. Starting with $360=36\cdot 10$ gives $36=6\cdot 6$ and $10=2\cdot 5$; starting with $360=8\cdot 45$ gives $8=2\cdot 4$ and $45=5\cdot 9$. Continuing to split the composite numbers produces the same multiset of prime factors: three twos, two threes, and one five. The factorization tree records choices in the calculation, while the prime factorization records the invariant result.

The proof outline explains the uniqueness. Existence follows by splitting a composite number into smaller factors until only prime numbers remain. For uniqueness, Euclid's lemma says that a prime factor of one product must divide one factor of any other prime product equal to it. That factor must be the same prime number; cancel it and repeat. The crucial divisibility step appears in Book VII, Proposition 30 of Euclid's Elements. ^[ref]

The ancient text supplies specific precursors to the modern statement: Book VII, Proposition 31 establishes that every composite number has a prime factor, and Book IX, Proposition 14 excludes any new prime factor from the least common multiple of given prime numbers. These are the propositions being cited, rather than the complete modern exponent formulation of the fundamental theorem of arithmetic. ^{[ref] [ref]}

Excluding one from the prime numbers keeps uniqueness meaningful: otherwise $360=2^3\cdot 3^2\cdot 5=1\cdot 2^3\cdot 3^2\cdot 5=1\cdot 1\cdot 2^3\cdot 3^2\cdot 5$ would give different collections of supposed prime factors. For $n=1$, the natural convention is the empty product, equal to one, with no prime factors and all prime valuations zero.

A Fermat prime is a Fermat number that is also a prime number:The defining form alone does not imply primality. For example, $65537$ is a Fermat prime, while $4294967297$ is a Fermat number with proper divisors. For $k\ge 1$, every Fermat prime is one modulo four and two modulo three. Pépin's test gives an exact primality testing criterion for these candidates, rather than relying on their form.

If $P(X)\le A^X$ for every $X\ge 1$, where $A>1$, thenfor $X\ge 2$. Every prime in $(\sqrt{X},X]$ contributes at least $\sqrt{X}$ to the primorial, soTaking logarithms, using $\pi (\sqrt{X})\le \sqrt{X}$, and observing that $\log X\le \sqrt{X}$ for $X\ge 2$ proves the claim.

A surface gravity wave is a free-surface oscillation restored by gravity. In inviscid deep water its angular frequency and horizontal wavenumber satisfy ${\omega }^2=gk$.

Inviscid flow between closing hinged plates is a quadratic potential flow that expels fluid radially.

For radial flow outside a sphere, incompressible flow makesindependent of radius. Its velocity potential is $\varphi =-Q/(4\pi r)$.

For a sphere of radius $a$ translating at speed $U$ along the polar axis through fluid at rest at infinity, the laboratory-frame potential isIt gives $u_r=U{a}^3\cos \theta /r^3$ and $u_{\theta }=U{a}^3\sin \theta /(2r^3)$.

Quantum tunnelling is transmission through a potential barrier even when the particle energy is below the barrier height.

The wavefunction penetrates the classically inaccessible region; matching it to an outgoing scattering state on the far side gives a nonzero transmission probability. For a real, time-independent potential barrier, the transmitted energy equals the incident energy: quantum tunnelling does not require a temporary violation of conservation of energy. A tunnel junction turns this small transmission probability into a measurable electric current, whose sensitivity to separation makes the scanning tunnelling microscope possible.

Glacial isostatic adjustment is the broader solid-Earth and sea-level response to growth and retreat of ice sheets.

A trapping region is a compact region across whose boundary the vector field points inward. It is positively invariant and confines every forward trajectory that enters it.

This is a dynamical example of an invariant; forward invariance and strict inward trapping are additional conditions.

A reproducing-kernel Hilbert space is a Hilbert space of functions in which point evaluation is continuous and satisfies $f(x)=⟨f,k(x,\cdot )⟩$.

For points $x_1,\dots ,x_n$, the kernel matrix has entries $K_{ij}=k(x_i,x_j)$ and is positive semidefinite.

A positive-definite matrix $V$ defines the inner product $x^{T}Vy$, allowing decomposition into a chosen direction and its $V$-orthogonal complement.

Velocity is the vector giving the rate of change of position with time, measured in a specified reference frame. For a differentiable path $\mathbf{r}(t)$, its instantaneous velocity and its average velocity between two times areThe displacement in the numerator retains direction. In Cartesian coordinates, each vector component is a derivative, for example $v_x=dx/dt$; its sign tells whether the corresponding coordinate is increasing or decreasing. The SI unit of velocity is $m/s$. ^[ref]

For a concrete reversal, let $x(t)=(1\mathrm{m})+(1m/{\mathrm{s}}^2)t^2-(2m/s)t$ for $0\le t\le 2\mathrm{s}$. Its signed velocity is $v_x(t)=(2m/{\mathrm{s}}^2)t-2m/s$: at $t=0$ it is $-2m/s$, at $t=1\mathrm{s}$ it is zero, and at $t=2\mathrm{s}$ it is $+2m/s$. The opposite endpoint velocities describe opposite directions, although the endpoint speeds agree. The position moves from $1\mathrm{m}$ to $0$ and back to $1\mathrm{m}$.

Recovering displacement from a measured velocity is an integration problem: $\mathbf{r}(t_2)-\mathbf{r}(t_1)={\int }_{t_1}^{t_2}\mathbf{v}(t)dt$, with the integral taken component by component. In the reversal example, ${\int }_0^{2\mathrm{s}}{v}_x(t)dt=0$: the negative and positive contributions cancel. This distinction is useful in navigation, where the final position depends on direction as well as speed.

Plane polar coordinates describe a point by its radial distance $r$ and polar angle $\theta$.

These are the planar polar coordinates; the general coordinate-system definition and transformations belong to that canonical concept.