Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10 5/3/83; site hp-pcd.UUCP
Path: utzoo!linus!decvax!harpo!seismo!hao!hplabs!hp-pcd!orstcs!mckenney
From: mckenney@orstcs.UUCP
Newsgroups: net.lang.prolog
Subject: Re: Another Puzzle - (nf)
Message-ID: <1815@hp-pcd.UUCP>
Date: Mon, 12-Sep-83 03:10:30 EDT
Article-I.D.: hp-pcd.1815
Posted: Mon Sep 12 03:10:30 1983
Date-Received: Sun, 18-Sep-83 13:45:01 EDT
Sender: notes_gateway@hp-pcd.UUCP
Organization: Oregon State University, Corvallis, OR
Lines: 29

#R:sri-arpa:-485400:orstcs:23900001:000:660
orstcs!mckenney    Sep 10 01:14:00 1983

Hypothetical General Solution to "Another Puzzle"

	For any string of digits greater than 6 in length, the following
	solution is unique:

	x21y1000

	where "x" is replaced by <base - 4> and "y" is replaced by a
	string of <x - 7> zeros.  Note that a string of digits of base
	n will also be of length n.

	Examples:

		Base 7  -- 3211000
		Base 10 -- 6210001000
		Base 16 -- C210000000001000
	
	For bases 2 through 6, no solution exists.

	Now, I have no idea how one would go about programming this into
	a Prolog program of reasonable running time.  (I have produced
	a -very- informal (read probably bug-ridden) proof by hand).

			Paul
			orstcs!mckenney