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: [EMAIL PROTECTED] [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 [email protected] https://www1.ietf.org/mailman/listinfo/dix
