Re: Sum of factors
- From: Christian Bau <christian.bau@xxxxxxxxxxxxxxxxxxxx>
- Date: Thu, 21 Apr 2005 00:43:07 +0100
In article <d44vcl$eeq$1@xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx>,
"Néstor" <c@xxxxx> wrote:
> <stush@xxxxxxxxxxxxxx> escribió en el mensaje
> news:1113932528.346824.109000@xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
>
> >Can I ask under what circumstances you will have an N and M meeting
> >those conditions? If I give you N, can you tell me M? I'm asking
> >because if you were given N and M such as above, I can't see how you
> >could know a+b=c+d without knowing a,b,c, and d.
>
>
> Well... Suppose I know it. And suppose M and N are so big I can´t factor
> them in a reasonable time.
Difficult.
You can probably find the factors if M and N are very close together.
Assume that c = a +/- 1, solve for a, b, c and d, check if the results
are integers. Same for c = a +/- 2, c = a +/- 3 and so on. If M and N
are very close then there is probably a low limit how far a and c can be
apart.
.
- Follow-Ups:
- Re: Sum of factors
- From: Néstor
- Re: Sum of factors
- References:
- Sum of factors
- From: Néstor
- Re: Sum of factors
- From: stush
- Re: Sum of factors
- From: Néstor
- Sum of factors
- Prev by Date: JSH: Objectivity, linking hyperbolas
- Next by Date: JSH: What will you do?
- Previous by thread: Read Carefully
- Next by thread: Re: Sum of factors
- Index(es):
Relevant Pages
|