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

For two integers $A$ and $B$, how can we find the number of positive integers $N$ such that $N\times B$ has at least one divisior $D$ that lies in $N \lt D \le A$?

For example, if $A = 100$ and $B = 11$ then the answer is $41$.

share|cite|improve this question

Are you expecting some simple math formula for the following value?
$$\left|\left\{n\in\mathbb{N}\ :\ \exists n_1,n_2,d\in\mathbb{N}\ :\ n=n_1 n_2,\ \ d\mid B,\ \ n_1<d,\ \ n_2\le\frac Ad\right\}\right|$$ Hard to believe such formula exists.
But it can be computed :-)

share|cite|improve this answer

Your Answer

 
discard

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.