{"paper":{"title":"Multiplicative Congruences with Variables from Short Intervals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Igor E. Shparlinski, Jean Bourgain, Moubariz Z. Garaev, Sergei V.Konyagin","submitted_at":"2012-10-24T03:35:38Z","abstract_excerpt":"Recently, several bounds have been obtained on the number of solutions to congruences of the type $$ (x_1+s)...(x_{\\nu}+s)\\equiv (y_1+s)...(y_{\\nu}+s)\\not\\equiv0 \\pmod p $$ modulo a prime $p$ with variables from some short intervals. Here, for almost all $p$ and all $s$ and also for a fixed $p$ and almost all $s$, we derive stronger bounds. We also use similar ideas to show that for almost all primes, one can always find an element of a large order in any rather short interval."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.6429","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}