Re: Re: smallest fraction
- To: mathgroup at smc.vnet.net
- Subject: [mg86828] Re: [mg86792] Re: [mg86771] smallest fraction
- From: Artur <grafix at csl.pl>
- Date: Sat, 22 Mar 2008 00:54:31 -0500 (EST)
- References: <200803200757.CAA29500@smc.vnet.net> <200803210653.BAA18315@smc.vnet.net>
- Reply-to: grafix at csl.pl
If value p/q is known smallest Abs[p]+Abs[q ] should be << NumberTheory`Recognize` Recognize[p/q,1,x] see also http://www.research.att.com/~njas/sequences/A138335 Best wishes, Artur Curtis Osterhoudt pisze: > I doubt this is in the spirit of the problem, but if p and q (assumed > integers) aren't restricted to be _positive_, then taking them both to be > very large negative numbers would both fit the p/q in I requirement, and p+q > as "small" as possible. > > C.O. > > On Thursday 20 March 2008 01:57:30 masmoudi wrote: > >> hi >> >> suppose that we have an interval I belong to [0,1] >> >> I want to know how to calculate a fraction p/q >> belong to I and p+q is the smallest possible >> > > > >
- Follow-Ups:
- Re: Re: Re: smallest fraction
- From: Artur <grafix@csl.pl>
- Re: Re: Re: smallest fraction
- References:
- smallest fraction
- From: masmoudi <mas_atef@yahoo.fr>
- Re: smallest fraction
- From: Curtis Osterhoudt <cfo@lanl.gov>
- smallest fraction