I am creating a spreadsheet that is using VLOOKUP to give a bunch of data based on a dropdown box.
It is a fairly large list (the screenshot does not do it justice), and the data is part of a table ...
If one uses np.linalg.solve to solve linear equations, the result has dtype=float.
While this is ok for "small" integers, larger ones result in wrong results:
import numpy as np
A = np.array([[...
I have the following problem:
> 1e20 %% 3
probable complete loss of accuracy in modulus
The result can't be correct and I'm sure it is because 1e20 is really big. But I ...
Taking the MD5 of a string as a 128-bit representation of an integer x, how do I compute x % y in Google Bigquery, where y will typically be relatively small (approx 1000)?
Bigquery has an MD5 ...
I wrote the following code to calculate a probability. I know the formula I used is correct. The code gives reasonable results for small values of m and n. However, for the large values of m and n, ...
When I save a large number in R as an object the wrong number is saved? Why is that?
num <- 201912030032451613
#>  201912030032451616
Created on 2019-...
I have a program that calculates large numbers by storing them as strings, so that I can have very large digits that extend beyond long long.
I can add the strings using a function I've written that ...
I have a sample containing not very small numbers.
in_range = int(input("range: "))
fibo_list = 
a = 0
b = 1
count = 0
if in_range < 0:
elif in_range == 0:
while count < in_range:
Is there a fast and simple way to write a program in C#, that finds out if a big (something like 25 digits big) number is a perfect square or not?
Perfect squares are the numbers: 0^2=0,1^2=1,2^2=4,3^...
I've been thinking about ways to program for exteme distances, in the game Hellion for example, orbits could be near to scale in the ranges of millions of kilometers. However there was a common glitch ...
I need to manipulate variables that can hold values of size 10 ^ 200 or more.
In java I know there is a function called bigInt, in C I don't know how to handle it.
Does anyone know how to do this ...
In a number-theoretic algorithm manipulating very large integer n (hundred thousand bits to few millions), I need to test the jth bit. Either of these work:
if 1<<j & n != 0 :
# bit j ...
I'm working on a task on codewars and cannot understand how to make this function work faster for large numbers <= 200000000000000. The goal of the function is very simple - I just need to count ...
I'm writing a program which must take in an integer, N, in range 3<=N<=10^18.
This is one of the operations I have to perform with N.