What are integers?

Some articles on integers, integer:

Secret Sharing Using The Chinese Remainder Theorem - Secret Sharing Using The CRT
... determine a number S modulo k-many relatively prime integers, given that, then, the idea is to construct a scheme that will determine the secret S given ... Ultimately, we choose n relatively prime integers such that S is smaller than the product of any choice of k of these integers, but at the same time is greater than any choice of k-1 of them ... Since S is smaller than the smallest product of k of the integers, it will be smaller than the product of any k of them ...
Almost Integer
... In recreational mathematics an almost integer is any number that is very close to an integer ... Well known examples of almost integers are high powers of the golden ratio, for example The fact that these powers approach integers is non-coincidental, which ... Other occurrences of non-coincidental near-integers involve the three largest Heegner numbers where the non-coincidence can be better appreciated when ...
Lambek–Moser Theorem - Statement of The Theorem
... The theorem applies to any non-decreasing and unbounded function ƒ that maps positive integers to non-negative integers ... any such function ƒ, define ƒ* to be the integer-valued function that is as close as possible to the inverse function of ƒ, in the sense that, for all n, ƒ(ƒ*(n)) < n ≤ ƒ(ƒ*(n) + 1) ... the ranges of F and G form a partition of the positive integers ...
Arithmetic Dynamics - Integer Points in Orbits
... The orbit of a rational map may contain infinitely many integers ... F(x) is a rational map and some iterate F(n)(x) is a polynomial with integer coefficients, then every nth entry in the orbit is an integer ... this is the only way that an orbit can contain infinitely many integers ...
Secret Sharing Using The Chinese Remainder Theorem - Secret Sharing Using The CRT - Example
... Our pairwise coprime integers being, and ... Then and we compute the shares for each of the integers 11, 13, 17 and 19 ... of congruences By Bézout's identity, since, there exist positive integers and, that can be found using the Extended Euclidean algorithm, such that ...