nikolas

Members
  • Content count

    5
  • Joined

  • Last visited

Community Reputation

0

About nikolas

  • Rank
    Newbie
  1. many gredits to all of you and fabpig!
  2. @fabpig Ohh i see, no there will be only 5 lists! Hint: its 5 lists and only no matter how many elements you have, number 5 plays a role!
  3. in positions 234 in line 5 element 5 is missing, and so does element 3 in line 4 in position 345. and here: you should be meaning element 3(because 3 is in position 3) but in the 4th list in positions 123 there is no element 3
  4. @fabpig the numer of elements each list contains is n(variable). In this case n=5, and n>=3 always because of the number of permutations. e.g. for n=2, n!=1*2=2<5, but 3!=1*2*3=6>5 and as a result we can have the 5 lists.
  5. Hello everyone, i recently encountered a logic problem which is this: There is a list(original) that contains all numbers from 1...n, without duplicates and not necessary in order. We dont know that list but we know 5 other lists which are the result of the original in that way: The first list came from moving one number from the original list to another position( be careful, move not exchange), the second list came from moving another different number from the original list. What actions you must do to find the original list? for example: 5 lists={[1,2,5,3,4],[1,5,3,4,2],[4,2,1,5,3],[2,3,1,5,4],[2,1,3,4,5]} and the original is Original=[2,1,5,3,4].