### Some articles on *integers, integer*:

Secret Sharing Using The Chinese Remainder Theorem - Secret Sharing Using The CRT - Example

... Our pairwise coprime

... Our pairwise coprime

**integers**being, and ... Then and we compute the shares for each of the**integers**11, 13, 17 and 19 ... identity, since, there exist positive**integers**and, that can be found using the Extended Euclidean algorithm, such that ...Lambek–Moser Theorem - Statement of The Theorem

... and unbounded function ƒ that maps positive

... and unbounded function ƒ that maps positive

**integers**to non-negative**integers**... From 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

... of a rational map may contain infinitely many

... of a rational map may contain infinitely many

**integers**... For example, if F(x) is a polynomial with**integer**coefficients and if a is an**integer**, then it is clear that the entire orbit OF(a) consists of**integers**... if 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**...Almost Integer

... In recreational mathematics an almost

... 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-coincident ... Other occurrences of non-coincidental near-**integers**involve the three largest Heegner numbers where the non-coincidence can be better appreciated when expressed ...Secret Sharing Using The Chinese Remainder Theorem - Secret Sharing Using The CRT

... determine a number S modulo k-many relatively prime

... 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 ... than the smallest product of k of the**integers**, it will be smaller than the product of any k of them ...