Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked
 
PerlMonks  

How could it look like?

by emilbarton (Scribe)
on Aug 31, 2011 at 15:34 UTC ( #923448=note: print w/ replies, xml ) Need Help??


in reply to Re: How to get the translation seed?
in thread How to get the translation seed?

If you want a clue about what I expect, consider this. We have seen that the well ordered suite can be obtained by means of perm() after a certain amount of iterations. This is because permutations are cyclic. Now each permutation then has a certain cyclic value. I can imagine that a particular means of obtaining "n012.." could make use of this cyclic value and thus the rule might look like:

For any permutations x and y, if x has a cyclic value of (max cyclic value for the base) and y (medium cyclic value for the base) then "n012.." can be obtained by the following composition of perm()...

But this is just imagination about what I would like to know.


Comment on How could it look like?
Download Code

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://923448]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others drinking their drinks and smoking their pipes about the Monastery: (5)
As of 2015-03-01 21:38 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    When putting a smiley right before a closing parenthesis, do you:









    Results (17 votes), past polls