ProgrammingThis forum is for all programming questions.
The question does not have to be directly related to Linux and any language is fair game.
Notices
Welcome to LinuxQuestions.org, a friendly and active Linux Community.
You are currently viewing LQ as a guest. By joining our community you will have the ability to post topics, receive our newsletter, use the advanced search, subscribe to threads and access many other special features. Registration is quick, simple and absolutely free. Join our community today!
Note that registered members see fewer ads, and ContentLink is completely disabled once you log in.
If you have any problems with the registration process or your account login, please contact us. If you need to reset your password, click here.
Having a problem logging in? Please visit this page to clear all LQ-related cookies.
Get a virtual cloud desktop with the Linux distro that you want in less than five minutes with Shells! With over 10 pre-installed distros to choose from, the worry-free installation life is here! Whether you are a digital nomad or just looking for flexibility, Shells can put your Linux machine on the device that you want to use.
Exclusive for LQ members, get up to 45% off per month. Click here for more info.
Hi, I have been trying to write a simple C++ program (using gcc 3.3.2) to find large prime numbers, which usually involves using the modulo (%) operator to check for factors. I need at least 11 significant digits to have adequate precision, but the int type apparently doesn't go that high. Is it possible to perform a modulo operation with floating point numbers, or alternatively, use ints with at least 11 significant digits?
You can't use the modulo operator on floating point numbers, but you can get an int with 11 significant digits. In gcc you just use the variable type long long (yes, 2 of them). This will get you a 64-bit integer which should be more than enough.
If you really need HUGE integers, check out libgmp (GNU Multiple Precision library). This will enable you to use thousands (possibly millions) of digits.
But, like itsme86 already said, "long long int" will go a long long way as well. If you don't need negative number, you can also double the range with "unsigned long long int".
If you have libgmp installed, "info gmp" will give you the documentation.
Thanks! For some reason, "long long int" still doesn't accept the numbers, but using drem() from the math.h package lets me calculate remainders with just a "double" datatype. I'll try it out and see how it goes.
Floating point operations sometimes create 'fuzz' - imprecise results way out at 8 or 10 decimal places. It's caused by floating point representations of odd numbers. When you are working with 12 digits of precision, you may bump into fuzz.
You will be much better of using an extended precsision library - why it was invented in the first place. double will not work for you reliably.
LinuxQuestions.org is looking for people interested in writing
Editorials, Articles, Reviews, and more. If you'd like to contribute
content, let us know.