Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Let $n\in\mathbb{N}$ and let $q\in[n,2n]$ be a prime number.

In addition, let $s,s':\mathbb{F}_q\to\mathbb{F}_q$ be polynomials of degree $\sqrt{n}$ such that $s\neq s'$.

From the Schwartz–Zippel lemma (or simply because $s-s'$ is also a polynomials of degree $\sqrt{n}$, thus is has at most $\sqrt{n}$ roots) we know that $$\Pr_{r\in \mathbb{F}_q}[s(r)=s'(r)]\leq\frac{\sqrt{n}}{q}\leq\frac{1}{\sqrt{n}}$$

What is the best upper bound I can give for the probability over $r$ which is uniformly picked out of $\{1,\ldots,\sqrt{n}\}$ ? That is $$\Pr_{r\in \{1,\ldots,\sqrt{n}\}}[s(r)=s'(r)]\leq\quad?$$

share|cite|improve this question
up vote 3 down vote accepted

It seems to me that we are at liberty to choose the polynomials $s$ and $s'$. So let's select $s'=0$ and $$s(x)=(x-1)(x-2)\cdots(x-[\sqrt{n}]).$$ Then $s(r)=s'(r)$ for all $r$ in the given range,and both these polynomials meet your bound on their degree. Thus the upper bound $Pr()\le 1$ can be attained, and is therefore the best bound.

Or did you want to ask something else?

share|cite|improve this answer
Of course, foolish of me. Thanks ! – User1234 Oct 4 '11 at 9:15

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.