A density Chinese remainder theorem

MaRDI QIDQ5495437zbMATHFDO

Authors D. Jason Gibson

Publication date 4 August 2014

Full work available at URL https://arxiv.org/abs/1302.0917

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

congruencelonely runner conjectureChinese remainder theorem

Mathematics Subject Classification ID

Congruences; primitive roots; residue systems (11A07) Other combinatorial number theory (11B75)

Abstract: Given collections A and B of residue classes modulo m and n, respectively, we investigate conditions on A and B that ensure that, for at least some a in A and b in B, the linear system x = a mod m, x = b mod n has an integer solution, and we quantify the number of such admissible pairs (a,b). The special case where A and B consist of intervals of residue classes has application to the Lonely Runner Conjecture.

Recommendations

• Publication:3203066
• scientific article; zbMATH DE number 5528975
• On a restricted linear congruence
• Equidistribution from the Chinese Remainder Theorem
• scientific article; zbMATH DE number 4214111

Cited in

(2)

• Equidistribution from the Chinese Remainder Theorem
• An efficient algorithm for attribute-based subsequence matching

This page was built for publication: A density Chinese remainder theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5495437)