Extrapolate divisor & dividend from quotient?

I'm trying to settle a debate. I seem to remember learning, in 7th or 8th
grade, an algorithm by which the divisor and dividend can be determined
when only the quotient is known. I suppose that I should say "*a* divisor
and dividend", since there are infinite (although often redundant) pairs of
numbers that may yield a given quotient when divided. I suppose further
that I should say that I remember "being shown" such an algorithm, because
I certainly can't remember/reproduce it at this time.

For example, if given (the quotient) "125", the algorithm (a process of
successive approximations?) would yield, say, "250" and "2".

My colleagues say that I must have been dreaming during that class: there
is no such algorithm. Since I have been unable to (re-) construct the
process myself, I am beginning to think that they must be correct.

Can anyone shed light on this? Do you know of a process by which this can
be achieved? Can you point me to some references that will help prove (or
disprove) that such an algorithm exists? This has been stuck in my craw for
a few months now, and I am ready to settle the matter.

Thanks for any and all help!
.

Relevant Pages

  • Re: Extrapolate divisor & dividend from quotient?
    ... an algorithm by which the divisor and dividend can be determined ... I suppose that I should say "*a* divisor ... numbers that may yield a given quotient when divided. ... that I should say that I remember "being shown" such an algorithm, ...
    (sci.math)
  • Re: Extrapolate divisor & dividend from quotient?
    ... an algorithm by which the divisor and dividend can be determined ... I suppose that I should say "*a* divisor ... numbers that may yield a given quotient when divided. ... that I should say that I remember "being shown" such an algorithm, ...
    (sci.math)
  • Re: continued fractions
    ... The "one bit at a time" algorithm is just a special case of the ... The dividend and divisor will be expressed as ... The crucial part here is the "guessing" of the digit. ... digit is 1, and the result of the subtraction is your new w; ...
    (comp.lang.forth)
  • Little 4line code RNG.
    ... First test at a RNG with a Motorola ... and Miller algorithm from 1969, ... a 32bit long dividend described in above ... I chose 8 bits, ...
    (comp.theory)
  • Re: Maxima - computing number of components in M-set
    ... I have tried to translate it to Maxima but i could not remove bugs. ... Let's start at the innermost level of the apply.. ... The use of divisors is due to the algorithm. ... p is a trivial divisor of p but it makes no sense to ...
    (sci.math.symbolic)