Розмір відео: 1280 X 720853 X 480640 X 360
Показувати елементи керування програвачем
Автоматичне відтворення
Автоповтор
you could have calculated all the primes and called find recurring only on those, wouldn't that be more efficient?
Is there a property of the prime numbers which would guarantee that would have the longest recurring as opposed to some composite number over any input range?
you could have calculated all the primes and called find recurring only on those, wouldn't that be more efficient?
Is there a property of the prime numbers which would guarantee that would have the longest recurring as opposed to some composite number over any input range?