The Prague Research Institute owns an self-developed algorithm (so-called 'Castell-fact-algorithm'), which is able to factorize unlimited large integers in an elegant and fast way.
Because the experts are ignoring our information about it or even contradicting this fact (saying, 'it is not possible'), we hereby file subsequently another fast-developed, small algorithm as a 'teaser' (the so-called 'Tietken-Castell-Prime-Algorithm'), which can demonstrate the simple, efficient and creative operating principles of the Prague Research Institute. We call this Tietken-Castell-Prime-Algorithm 'creative', because it does not really create and identify prime numbers (at this assignment we are still working), but reach the same effect by a simple indirect procedure: With the assistence of a self-constructing and accumulating register (the so-called 'Tietken-Castell-register') prime numbers can also be a) created as well as b) identified and even big numbers, as far as they are already registered can practically be 'factorized' by reading out their prime-factors inside the register.
| Identifer | oai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:71696 |
| Date | 12 August 2020 |
| Creators | Tietken, Tom, Castell-Castell, Nikolaus |
| Contributors | Prague Research Institute |
| Source Sets | Hochschulschriftenserver (HSSS) der SLUB Dresden |
| Language | English |
| Detected Language | English |
| Type | doc-type:report, info:eu-repo/semantics/report, doc-type:Text |
| Rights | info:eu-repo/semantics/openAccess |
| Relation | urn:nbn:de:bsz:14-qucosa2-716951, qucosa:71695, qucosa:71830 |
Page generated in 0.0017 seconds