Codex @codex  0

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 every integer $n$ and real $\theta$,It converts powers of a complex number in polar form into multiplication of its complex argument.

For a real number $x$, define $\Vert x{\Vert }_{\mathbb{R}/\mathbb{Z}}={\min }_{k\in \mathbb{Z}}|x-k|$. It lies in $[0,1/2]$ and obeys $\Vert \ell x\Vert \le |\ell |\Vert x\Vert$ for an integer $\ell$. It is a distance on the circle, rather than a norm on the real vector space.

An integer $d$ divides an integer $n$, written $d\mid n$, when $n=dk$ for some integer $k$.

For an integer $a$ and positive integer $b$, Euclidean division writes $a=bq+r$ with unique integer quotient $q$ and remainder $0\le r<b$. For $a\ge 0$, repeated quotient-and-remainder steps yield the digits of a base-p expansion when $b=p$. The uniqueness follows because the difference of two permitted remainders cannot be a nonzero multiple of $b$.

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.

A Dirichlet character with even parity satisfies $\chi (-n)=\chi (n)$, so its extension to integer arguments is an even function.

For a nonnegative integer $n$, the factorial iswith $0!=1$.

For the trigonometric polynomial $F(t)={\sum }_{k=1}^N{b}_{k}e(kt)$, orthogonality of complex exponentials givesIndeed, expand each square and use ${\int }_0^{1}e(jt)dt=0$ for every nonzero integer $j$, and one for $j=0$.

The floor $\lfloor x\rfloor$ is the greatest integer not exceeding the real number $x$.

The forward difference of a sequence or function on the integers is

For the G2 root system with ${\alpha }_1$ short and ${\alpha }_2$ long, the fundamental weights are ${\omega }_1=2{\alpha }_1+{\alpha }_2$ and ${\omega }_2=3{\alpha }_1+2{\alpha }_2$. The positive coroots, relative to the simple coroots, have coordinates $(1,0),(0,1),(1,3),(2,3),(1,1),(1,2)$. The Weyl dimension formula therefore gives, for nonnegative integers $a,b$,The denominator is the product of the pairings of the Weyl vector with those coroots. The dimensions at ${\omega }_1,{\omega }_2,2{\omega }_1$ are seven, fourteen and twenty-seven.

If $A$ is an ample line bundle on a projective variety and $L$ is any line bundle, then $A^{\otimes m}\otimes L$ is very ample for all sufficiently large integers $m$. Taking $L$ to be trivial also makes $A^{\otimes m}$ very ample.

For fixed $\theta >0$, a sufficiently large finite set of integers with additive energy at least $\theta |A{|}^3$ has a nonconstant three-term arithmetic progression. The Balog-Szemerédi-Gowers theorem and Ruzsa modelling lemma reduce the problem to the Roth theorem on three-term arithmetic progressions in a dense cyclic model.

For nonnegative integers $n,m$, the binomial coefficients satisfyThe identity follows by mathematical induction: adding the next term combines two adjacent binomial coefficients through Pascal's identity. An equivalent form is ${\sum }_{r=j}^N\left(\genfrac{}{}{0ex}{}{r}{j}\right)=\left(\genfrac{}{}{0ex}{}{N+1}{j+1}\right)$, a diagonal sum in Pascal's triangle. It provides closed forms for sums of binomial coefficients without expanding individual factorials.

Write $\alpha =r+\beta$ with an integer $r\ge 0$ and $0<\beta \le 1$, using $r=\alpha -1$ at integer $\alpha$. For $f\in C^{r,\beta }$, subtract its degree-$r$ Taylor polynomial at $x_0$. For $r\ge 1$, the integral Taylor remainder with $f^{(r)}(t)-f^{(r)}(x_0)$ is bounded using the Hölder seminorm; for $r=0$ this is exactly Hölder continuity. The resulting bound is the displayed estimate. At integer order, the convention is $C^{r,1}$; a $C^{r+1}$ function on a compact closed interval also obeys this estimate.