|
[Date Index]
[Thread Index]
[Author Index]
Re: A difficult problem
- To: mathgroup at smc.vnet.net
- Subject: [mg40300] Re: [mg40298] A difficult problem
- From: Andrzej Kozlowski <akoz at mimuw.edu.pl>
- Date: Sun, 30 Mar 2003 20:14:19 -0500 (EST)
- Sender: owner-wri-mathgroup at wolfram.com
You can't. All you can say is that either n2=n1 or n2=8+n1.
On Sunday, March 30, 2003, at 06:10 pm, Billy Yeung wrote:
> I have a difficult problem:
> Given a constant integer X (which may be very large) , you no need to
> find the value of X
> and
> X mod 8 = n1
> X mod 16 = n2
> the problem is that find n2 if n1 is know?
>
>
>
Prev by Date:
Re: Need a nice way to do this
Next by Date:
Re: Plotting intersections
Previous by thread:
A difficult problem
Next by thread:
Re: A difficult problem
|