How I Can Check Large Digit Prime Number.

Question

5.00/5 (1 vote)

See more:

How i can check that large number is prime or not using c++
I want to check
48112959837082048697
number is prime or not.
this is 20 digit prime number but my program in c++ can not check it.

Posted 29-Jan-15 0:39am

Vishal I. Sahuji

Add a Solution

1 solution

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Leo Chapiro · Answer 1 · 2015-01-29T00:45:00

Solution 1

You can use the C++ Big Integer Library[^] of Matt McCutchen:

C++

#include "BigIntegerLibrary.hh"

BigInteger a = 65536;
cout << (a * a * a * a * a * a * a * a);

(prints 340282366920938463463374607431768211456)

Posted 29-Jan-15 0:45am

Leo Chapiro

Comments

/\jmot 29-Jan-15 7:09am

good move. +5
:)

Leo Chapiro 29-Jan-15 7:36am

Thank you!