I got another nice prize from Kadon Games !!!
The place where you can find incredible fun challenging puzzle games.
1 month ago
If there are n characters between the double quote and the end of the string, the regex engine will try 2 1/n permutations of ‹ (?:[^"\r\n]+|"")* ›
it appears: 2^(1/n)
(this trends to 1, when n grows)
however, it must say 2^(n-1)
when n=4 the number of permutations is 8.
(thus, it has an exponential behaviour).
The method assumeFalse(String, boolean) is undefined for the type Assume
The composite cofactor of the RSA public key factored into 91-digit and 97-digit prime numbers. With these factors, we are able to decrypt the RSA-encrypted literary quote. What quote did Donald Knuth hide so well?
91-digit prime factor:
97-digit prime factor:
With these and the previously known 25-digit prime factor, 1144729885849400174143427, we are able to decrypt the RSA-encrypted literary quote. The quote is the following:
His remarks (as reported) were as follows:--
"O Rowty-owty tiddly-owty
--G. K. Chesterton (1905)
This is from The Tremendous Adventures of Major Brown, the first in the collection of short stories The Club of Queer Trades.
"How many ways can this person traverse, say, a 100 meters? The answer is fib(100): 3,314,859,971." The 100th fibonacci number is 354224848179261915075. The is way over what a JAVA primary int can hold though. BigInteger can be used to calculate this bigger integer however.