Re: Re: Re: smallest fraction

```If we want to find rational fraction f =p/q such that 113/355<f<106/333
and sum p+q is minimal
anyone procedure proposed  up to now doesn't work
good result should be
{137563,{p->13215,q->104348}}
but isn't
ARTUR

Artur pisze:
> If value p/q is known
> smallest Abs[p]+Abs[q ] should be
> << NumberTheory`Recognize`
> Recognize[p/q,1,x]
>
> 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
>>>
>>>
>>
>>
>>
>
>
> __________ NOD32 Informacje 2701 (20071204) __________
>
> Wiadomosc zostala sprawdzona przez System Antywirusowy NOD32
> http://www.nod32.com lub http://www.nod32.pl
>
>
>
>

```

• Prev by Date: Funny behaviour of ClipboardNotebook[] (Q: How to copy programmatically?)
• Next by Date: Grabbing a value from a Dynamic Object
• Previous by thread: Re: Re: smallest fraction
• Next by thread: Re: Re: Re: Re: smallest