**font-family: sans-serif**

From the fundamental theorem of arithmetic, we know that any integer greater than 1 can be expressed as a unique product of primes. A corollary of this theorem is:

_{1}

^{k1}p

_{2}

^{k2}… p

_{n}

^{kn}where, each k

_{i}is a positive integer and each p

_{i}is a prime for positive integers i, 1 ≤ i ≤ n.

aThe integral of a function f over the interval [a, b] can be calculated by finding an antiderivative F of f:^{φ(n)}≡ 1 (mod n)

∫where_{a}^{b}f(x) dx = F(a) - b(a)

^{d}⁄

_{dx}F(x) = f(x)

**font-family: arial**

From the fundamental theorem of arithmetic, we know that any integer greater than 1 can be expressed as a unique product of primes. A corollary of this theorem is:

Any positive integer N > 1 can be written uniquely in a canonical form N = pEuler's theorem states that if n is a positive integer and a is a positive integer coprime to n, then_{1}^{k1}p_{2}^{k2}… p_{n}^{kn}where, each k_{i}is a positive integer and each p_{i}is a prime for positive integers i, 1 ≤ i ≤ n.

aThe integral of a function f over the interval [a, b] can be calculated by finding an antiderivative F of f:^{φ(n)}≡ 1 (mod n)

∫where_{a}^{b}f(x) dx = F(a) - b(a)

^{d}⁄

_{dx}F(x) = f(x)

**font-family: helvetica**

From the fundamental theorem of arithmetic, we know that any integer greater than 1 can be expressed as a unique product of primes. A corollary of this theorem is:

Any positive integer N > 1 can be written uniquely in a canonical form N = pEuler's theorem states that if n is a positive integer and a is a positive integer coprime to n, then_{1}^{k1}p_{2}^{k2}… p_{n}^{kn}where, each k_{i}is a positive integer and each p_{i}is a prime for positive integers i, 1 ≤ i ≤ n.

aThe integral of a function f over the interval [a, b] can be calculated by finding an antiderivative F of f:^{φ(n)}≡ 1 (mod n)

∫where_{a}^{b}f(x) dx = F(a) - b(a)

^{d}⁄

_{dx}F(x) = f(x)

**font-family: 'trebuchet ms'**

Any positive integer N > 1 can be written uniquely in a canonical form N = pEuler's theorem states that if n is a positive integer and a is a positive integer coprime to n, then_{1}^{k1}p_{2}^{k2}… p_{n}^{kn}where, each k_{i}is a positive integer and each p_{i}is a prime for positive integers i, 1 ≤ i ≤ n.

aThe integral of a function f over the interval [a, b] can be calculated by finding an antiderivative F of f:^{φ(n)}≡ 1 (mod n)

∫where_{a}^{b}f(x) dx = F(a) - b(a)

^{d}⁄

_{dx}F(x) = f(x)

**font-family: georgia**

_{1}^{k1}p_{2}^{k2}… p_{n}^{kn}where, each k_{i}is a positive integer and each p_{i}is a prime for positive integers i, 1 ≤ i ≤ n.

aThe integral of a function f over the interval [a, b] can be calculated by finding an antiderivative F of f:^{φ(n)}≡ 1 (mod n)

∫where_{a}^{b}f(x) dx = F(a) - b(a)

^{d}⁄

_{dx}F(x) = f(x)

**font-family: monospace**

_{1}^{k1}p_{2}^{k2}… p_{n}^{kn}where, each k_{i}is a positive integer and each p_{i}is a prime for positive integers i, 1 ≤ i ≤ n.

aThe integral of a function f over the interval [a, b] can be calculated by finding an antiderivative F of f:^{φ(n)}≡ 1 (mod n)

∫where_{a}^{b}f(x) dx = F(a) - b(a)

^{d}⁄

_{dx}F(x) = f(x)

**font-family: 'bistream sans vera mono'**

_{1}^{k1}p_{2}^{k2}… p_{n}^{kn}where, each k_{i}is a positive integer and each p_{i}is a prime for positive integers i, 1 ≤ i ≤ n.

aThe integral of a function f over the interval [a, b] can be calculated by finding an antiderivative F of f:^{φ(n)}≡ 1 (mod n)

∫where_{a}^{b}f(x) dx = F(a) - b(a)

^{d}⁄

_{dx}F(x) = f(x)

## No comments