Modular Arithmetic Problem?
- To: mathgroup at smc.vnet.net
- Subject: [mg38975] Modular Arithmetic Problem?
- From: "David Park" <djmp at earthlink.net>
- Date: Thu, 23 Jan 2003 08:04:38 -0500 (EST)
- Sender: owner-wri-mathgroup at wolfram.com
Dear MathGroup, Steven Shippee asked me about methods of solving the following problem. Find the numbers n such that n^2 is a five digit number with 0 in the second digit and 1 in the last digit. (i.e., x0xx1 where x is a digit 0..9). We know how to solve the problem by testing a list of all possible candidate numbers. But is there a method that uses Solve and modular arithimetic or some other clever method? If one looks at the answers one would think there must be. David Park djmp at earthlink.net http://home.earthlink.net/~djmp/
- Follow-Ups:
- Re: Modular Arithmetic Problem?
- From: Dr Bob <drbob@bigfoot.com>
- Re: Modular Arithmetic Problem?