Since 3 is a prime number, it can only be divisible by 1 and itself, and four is not divisible by 3, so the fraction cannot be reduced further.
In the fraction 3/4, 3 is a prime number, so its only factors are 1 and itself, and 4 is not divisible by three, so the fraction has been simplified as much as possible.
For example, 3 : 56 cannot be reduced because the two numbers share no common factors - 3 is a prime number, and 56 is not divisible by 3. Use multiplication or division to "scale" ratios.
Note that the order of (E_q C_{frac{1}{2}(q-1)}) is odd and the orders of (D_{q-1}) and (D_{q+1}) are not divisible by 3.
In number theory he proved the existence of an infinite number of primes in any arithmetic series a + b, 2a + b, 3a + b,..., na + b, in which a and b are not divisible by one another.
For any nonzero rational number, there exists a unique integer such that, where and are integers not divisible by.
If any non-zero rational number x is represented as x = p γ m n, where m and n are integers which are not divisible by p, and γ is an integer, then | x | p = p − γ.
k = 3 is possible for all such graphs (k = 2 is not sufficient as seen for instance in complete graphs and cycles of length not divisible by 4).
For any nonzero rational number x, there exists a unique integer n x ∈ Z such that x = a b p n x, where a and b are integers not divisible by p. Then | x | p : = p − n x defines a non-Archimedean norm on ℚ.
For any nonzero rational number a, there exists a unique integer r such that a = p r m / n, where m and n are integers not divisible by p. Then | a | p : = p − r defines a non-Archimedean norm on Q.
