A difficult problem
- To: mathgroup at smc.vnet.net
- Subject: [mg40298] A difficult problem
- From: Billy Yeung <eg_ysyaa at stu.ust.hk>
- Date: Sun, 30 Mar 2003 04:10:02 -0500 (EST)
- Sender: owner-wri-mathgroup at wolfram.com
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?