MathGroup Archive 2003

[Date Index] [Thread Index] [Author Index]

Search the Archive

A difficult problem

  • To: mathgroup at
  • Subject: [mg40298] A difficult problem
  • From: Billy Yeung <eg_ysyaa at>
  • Date: Sun, 30 Mar 2003 04:10:02 -0500 (EST)
  • Sender: owner-wri-mathgroup at

I have a difficult problem:
Given a constant integer X (which may be very large) , you no need to find the value of X
X mod 8 = n1
X mod 16 = n2
the problem is that find n2 if n1 is know?

  • Prev by Date: RE: Problems with TickFunction
  • Next by Date: Plotting intersections
  • Previous by thread: Re: (how?) notebooks with I/O loop
  • Next by thread: Re: A difficult problem