Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/18/84 exptools; site ihnet.UUCP
Path: utzoo!watmath!clyde!cbosgd!ihnp4!ihnet!eklhad
From: eklhad@ihnet.UUCP (K. A. Dahlke)
Newsgroups: net.math
Subject: permuting 0123456789
Message-ID: <201@ihnet.UUCP>
Date: Sun, 17-Feb-85 12:12:05 EST
Article-I.D.: ihnet.201
Posted: Sun Feb 17 12:12:05 1985
Date-Received: Tue, 19-Feb-85 07:56:54 EST
Distribution: net
Organization: AT&T Bell Laboratories
Lines: 13

< 3792156048 >

A problem in combinatorics.
	How many permutations of the digits 0-9 have no digits in common
with the identity permutation (0123456789)?
Examples:   2317495680 cannot be counted, since 4 and 8 are in the correct
position.  9876543210 is included, since no digit is in the correct position.
I have derived a recursive formula, but I really wanted the answer
(f(n)) in closed form.  Any ideas?
-- 
	Having, is not so pleasing a thing after all, as wanting.
	It is not logical, but it is often true.
Karl Dahlke    ihnp4!ihnet!eklhad