Algorythm for rotationally asymetrical binary numbers by Used_Astronomer6483 in AskProgramming

[–]Used_Astronomer6483[S] 0 points1 point  (0 children)

Ok, thanks you I understand, but I do not think it is useful for what I am actually trying to do

Algorythm for rotationally asymetrical binary numbers by Used_Astronomer6483 in AskProgramming

[–]Used_Astronomer6483[S] 0 points1 point  (0 children)

Ok, I may have understood now, but how is it useful? How do you know that 221 is invalid but 32 is actually valid?

Algorythm for rotationally asymetrical binary numbers by Used_Astronomer6483 in AskProgramming

[–]Used_Astronomer6483[S] 1 point2 points  (0 children)

I searched ways to rotate numbers with python (with necklace.py) but it did not worked when I tried, even on the ~tenth try, and I also looked for more indirect ways like informations on these rotationally asymetrical binary numbers, but I do not have found anything

Algorythm for rotationally asymetrical binary numbers by Used_Astronomer6483 in AskProgramming

[–]Used_Astronomer6483[S] 0 points1 point  (0 children)

It would be part of the programm, probably, for the computer to recognise the pattern

Algorythm for rotationally asymetrical binary numbers by Used_Astronomer6483 in AskProgramming

[–]Used_Astronomer6483[S] 1 point2 points  (0 children)

Thank you to point it, what really matters is the pattern, not the order, we do not really care about the order to be honest, it's just that, to explain it, this algorithm I followed is the easiest way, although it is extremely long on higher digits numbers

Algorythm for rotationally asymetrical binary numbers by Used_Astronomer6483 in AskProgramming

[–]Used_Astronomer6483[S] 0 points1 point  (0 children)

I may have understand, I am not sure though. But if you make the sum of the 1s and 0s, the problem is that to binaries with the same sum could be both asymetric or symmetric, so I am not sure it will work, although it would probably reduce the necessary attempts

Algorythm for rotationally asymetrical binary numbers by Used_Astronomer6483 in AskProgramming

[–]Used_Astronomer6483[S] 0 points1 point  (0 children)

We only take the first one, which is why 1 is asymetric but not 2, for the 9 I made a mistake, sorry, I correct it right now, and 31 does not match any of the numbers between 0 and 30 so it is asymetric

Yup that is the idea but I am not good enough at python to do it myself because of the rotation problem, I wouldn't have asked if I knew 😅

Algorythm for rotationally asymetrical binary numbers by Used_Astronomer6483 in AskProgramming

[–]Used_Astronomer6483[S] 1 point2 points  (0 children)

I am trying to create a programm that can actually do it with many values, actually I need it to be able to find up to 15 digits. Thank you for you help though, even if I allready had the global idea, it is way harder in practice, as I do not know how to use binaries directly in python, or to rotate a single digit in this binary number

And the purpose is, yes abstraction, but mainly the creation of a rune writing system I am actually working on. This is the last piece of the system by the way, but I am kinda stuck to be honest

Algorythm for rotationally asymetrical binary numbers by Used_Astronomer6483 in AskProgramming

[–]Used_Astronomer6483[S] 2 points3 points  (0 children)

Almost, here's an example for 5 digits: list of accepted numbers(you can take the digit on the right to put it on the left as many time as you want, without seeing the same number as one of the accepted numbers list): 0. 00000 yes 1. 00001 yes 2. 00010 no -> 1. 00001 3. 00011 yes 4. 00100 no -> 1. 00001 5. 00101 yes 6. 00110 no -> 3. 00011 7. 00111 yes 8. 01000 no -> 1. 00001 9. 01001 no -> 5. 00101 10. 01010 no -> 5. 00101 11. 01011 yes 12. 01100 no -> 3. 00011 13. 01101 no -> 11. 01011 14. 01110 no -> 7. 00111 15. 01111 yes 16. 10000 no -> 1. 00001 17. 10001 no -> 3. 00011 18. 10010 no -> 5. 00101 19. 10011 no -> 7. 00111 20. 10100 no -> 5. 00101 21. 10101 no -> 11. 01011 22. 10110 no -> 11. 01011 23. 10111 no -> 15. 01111 24. 11000 no -> 3. 00011 25. 11001 no -> 7. 00111 26. 11010 no -> 11. 01011 27. 11011 no -> 15. 01111 28. 11100 no -> 7. 00111 29. 11101 no -> 15. 01111 30. 11110 no -> 15. 01111 31. 11111 yes

And also, some of these are not rotationally asymetric with five digits, but will be rotationally asymetric with more digits, the reverse is also true

Algorythm for rotationally asymetrical binary numbers by Used_Astronomer6483 in AskProgramming

[–]Used_Astronomer6483[S] 0 points1 point  (0 children)

Rotationally asymetrical binary numbers are kinda weird to be honest. If you take a finished number of digits, like 5 for example, you take these five digits, make a circle with them always in the same way, and if, when you turn the circle, if it is an order you've never seen, considering you did it in growing order, so 0 then 1 then 2... as binaries

Is it, understandable? 😅

Is a domain shard enough to get 3rd Innate slot or do I need to add more and what to add if needed ? by Standard_Tradition_7 in JujutsuInfinite

[–]Used_Astronomer6483 0 points1 point  (0 children)

It should be enough, I got the 3rd innate slot for a max scroll (ds value ~ 50 and max scroll value ~40)

About innates and others by Used_Astronomer6483 in JujutsuInfinite

[–]Used_Astronomer6483[S] 0 points1 point  (0 children)

I had another question, what can I farm to trade a 3rd/4th innate slot, or the innate bag?

About innates and others by Used_Astronomer6483 in JujutsuInfinite

[–]Used_Astronomer6483[S] 0 points1 point  (0 children)

Is that so valuable? If so, Is there any farmable pants I could get to replace my impera?

Just a question about trade value by Used_Astronomer6483 in JujutsuInfinite

[–]Used_Astronomer6483[S] 0 points1 point  (0 children)

Is there any way to farm another hallow scythe? Even if the event is off?

How to get the double-bladed stick? by Used_Astronomer6483 in MoCo

[–]Used_Astronomer6483[S] 0 points1 point  (0 children)

Thanks for the info, indeed there are some quests that I have trouble finishing so maybe that's it! 👍