Skip to content

Calculates the longest chain of prime numbers e.g: " 18593 → 185593 → 1855993 .... " but limitation is the INT32 numberspace of Java. So no bigger prime chains than INT_MAX will be found.

License

Notifications You must be signed in to change notification settings

FloThinksPi/Prime-Chain-Calculator

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

6 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Instructions

Start with option -Xmx12G or more(needs lots of ram). Other possibillity is to set maxPrimeNumber in Config.java to a smaller value.

At the first run a prime database gets generated with all prime numbers from variables 0 to maxPrimeNumber= from Config.java. After that, prime chains will get searched betwen the variables startChainSearch and stopChainSearch from Config.java. All further runs will use the prime database file and will be faster. If you change maxPrimeNumber= from Config.java delete the prime database first so the primes get regenerated.

Longest primechain from 0 to INT32_MAX is [31, 331, 3331, 33331, 333331, 3333331, 33333331].

BSD 2-Clause License

Copyright (c) 2016, Florian Braun All rights reserved.

Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:

  • Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.

  • Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.

THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

About

Calculates the longest chain of prime numbers e.g: " 18593 → 185593 → 1855993 .... " but limitation is the INT32 numberspace of Java. So no bigger prime chains than INT_MAX will be found.

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages