[dix] Algorithm
tianxama <tianxama@gmail.com> Sat, 23 June 2007 00:20 UTC
Return-path: <dix-bounces@ietf.org>
Received: from [127.0.0.1] (helo=stiedprmman1.va.neustar.com) by megatron.ietf.org with esmtp (Exim 4.43) id 1I1tMb-0007wn-5S; Fri, 22 Jun 2007 20:20:29 -0400
Received: from [10.91.34.44] (helo=ietf-mx.ietf.org) by megatron.ietf.org with esmtp (Exim 4.43) id 1I1tMZ-0007wi-3l for dix@ietf.org; Fri, 22 Jun 2007 20:20:27 -0400
Received: from kuber.nabble.com ([216.139.236.158]) by ietf-mx.ietf.org with esmtp (Exim 4.43) id 1I1tMW-0001iz-RY for dix@ietf.org; Fri, 22 Jun 2007 20:20:27 -0400
Received: from isper.nabble.com ([192.168.236.156]) by kuber.nabble.com with esmtp (Exim 4.63) (envelope-from <bounces@nabble.com>) id 1I1tMW-0002dK-AR for dix@ietf.org; Fri, 22 Jun 2007 17:20:24 -0700
Message-ID: <11262055.post@talk.nabble.com>
Date: Fri, 22 Jun 2007 17:20:24 -0700
From: tianxama <tianxama@gmail.com>
To: dix@ietf.org
MIME-Version: 1.0
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable
X-Nabble-From: tianxama@gmail.com
X-Spam-Score: 0.0 (/)
X-Scan-Signature: e5ba305d0e64821bf3d8bc5d3bb07228
Subject: [dix] Algorithm
X-BeenThere: dix@ietf.org
X-Mailman-Version: 2.1.5
Precedence: list
Reply-To: Digital Identity Exchange <dix@ietf.org>
List-Id: Digital Identity Exchange <dix.ietf.org>
List-Unsubscribe: <https://www1.ietf.org/mailman/listinfo/dix>, <mailto:dix-request@ietf.org?subject=unsubscribe>
List-Archive: <http://www1.ietf.org/pipermail/dix>
List-Post: <mailto:dix@ietf.org>
List-Help: <mailto:dix-request@ietf.org?subject=help>
List-Subscribe: <https://www1.ietf.org/mailman/listinfo/dix>, <mailto:dix-request@ietf.org?subject=subscribe>
Errors-To: dix-bounces@ietf.org
Hi, Is this yet discovered? : 1. Given a "potential value" of a given number made of digits, wich is the reduction to one digit by succesive sum of its digits. 2. This value repeats in an interval (-(base-1)) - 0 - (base-1) 3. Let's call "weight" of a digit in the expression: (base pow positionDigit) * digit 4. Assigning identifiers, given the case, in a specific interval it happens that: a. Given three nodes, left, right and parent with respective identifiers. b. Maybe func(potentialValue(leftNodeID), potentialValue(rightNodeID)) == func(potentialValue(parentNodeID)) It's just an idea to develop how in a graph, reduced to a binary tree, one can, for example, calculate regarding only in node identifiers, if two nodes are interconnected and in how many and which type of leaps. Regards, -- [first: sebastián] [last: samaruga] [email: tianxama@gmail.com] [url: http://www.simetris.com.ar] -- View this message in context: http://www.nabble.com/Algorithm-tf3967603.html#a11262055 Sent from the IETF - dix mailing list archive at Nabble.com. _______________________________________________ dix mailing list dix@ietf.org https://www1.ietf.org/mailman/listinfo/dix
- [dix] Algorithm tianxama