Questions tagged [big-numbers]
Questions about or involving outside the range of normal machine precision, using Mathematica's capacity for arbitrary precision numbers and numbers outside the normal range of floating-point arithmetic.
55
questions
5
votes
2
answers
644
views
Can I use NextPrime[n] up to n=10^14?
I would like to perform computations with primes up to $n=10^{14}$. To do so, I would like to go through all primes, from $2$ to $10^{14}$ and perform some calculation on each prime.
I saw that one ...
- 1,009
2
votes
1
answer
103
views
How can I make sure that the two given numbers are exactly the same?
I have the given numbers $n1$ and $n2$. How can I make sure that these two numbers are exactly the same? Numerically, using {N[n1,40], N[n2,40]}, by increasing the ...
- 361
13
votes
1
answer
226
views
Performance regression for big integer computation
Backslide introduced in 12.0, persisting through 13.1.
Recently I noticed that the big integer calculation of the new version is much slower than the old version, can you reproduce, is there a way to ...
- 5,662
3
votes
2
answers
105
views
Check certain expression using a while loop to run through all posibilities in a range
Well, I have written the following code (using the fast square root test found in this answer):
...
- 2,001
7
votes
5
answers
354
views
Checking if a number is right sorted
I have a number $n$ such that the digits of $n$ are strictly increasing to the left except for the first digit. So for example when $n=51369$ fits the bill because:
$$1<3<6<9\tag1$$
Is there ...
- 2,001
5
votes
8
answers
1k
views
Making the number 12345...n
Well, I am trying to write a code that makes the number:
$$123456\dots n\tag1$$
So, when $n=10$ we get:
$$12345678910$$
And when $n=15$ we get:
$$123456789101112131415$$
And when $n=4$ we get:
$$1234$$...
- 2,001
0
votes
1
answer
96
views
Parallelization in While[] loop when testing if a condition is met
Well, I am trying to run the following code:
...
- 2,001
1
vote
0
answers
119
views
Implementing the Binary GCD algorithm in Mathematica
Well, I have $n\in\mathbb{N}$ and I want to transform $n$ to a binary number which can be done using FromDigits[IntegerDigits[n, 2]]. I want to compute the ...
- 2,001
4
votes
3
answers
273
views
Why $\pi$ // Rationalize does not give a rational multiple of $\pi$ in my example?
As an obvious example of π Rationalize, I see that
...
- 1,169
2
votes
1
answer
88
views
How to write this simple task of unimodular prime search in mathematica?
For testing a particular algorithm I found mathematica is the best way as it has all the tools I need. I am stuck in a number theory part and since I am not an expert in mathematica I do not know how ...
- 145
1
vote
2
answers
68
views
Filtering solutions in PowerRepresentations
I have the following code:
PowersRepresentations[10400, 7, 2]
This produces Length[PowersRepresentations[10400, 7, 2]]=433789 ...
- 2,001
2
votes
1
answer
98
views
Help: Obtain a huge amount of data solved in FrobeniusSolve? (perhaps better without running FrobeniusSolve?) [closed]
How to obtain a huge amount of data solved in FrobeniusSolve more systematically?
I am interested in obtaining these two sets of data from FrobeniusSolve:
...
- 923
1
vote
1
answer
96
views
1
vote
1
answer
305
views
Using more than 6 kernels in ParallelTable function [duplicate]
I have the following code:
ParallelTable[
If[IntegerQ@Sqrt[80892036 + 17994 x (1 + x) (-5995 + 5998 x)], x,
Nothing], {x, 6694300, 31072325}]
It uses 6 ...
- 2,001
2
votes
1
answer
308
views
Using Parallelize in a solve function
Is there a way to use Parallelize the following operation, in order to make it do the calculations faster? Or is there another way to speed up this calculation?
...
- 2,001