294 reputation
215
bio website
location
age
visits member for 2 years, 4 months
seen Oct 6 at 14:19

Oct
1
awarded  Disciplined
Jul
2
awarded  Curious
May
27
awarded  Popular Question
Mar
24
awarded  Notable Question
Mar
2
awarded  Popular Question
Jan
11
awarded  Popular Question
Sep
4
awarded  Popular Question
Jul
18
comment Finding the sum of two numbers knowing only the primes
@RossMillikan I am doing this in C++ for something work-related and I can't use bignums for this
Jul
18
comment Finding the sum of two numbers knowing only the primes
@jameselmore right; I am working with some large numbers in a program and I can't store the full value, so I am trying to store the prime factorization instead to save memory.
Jul
18
asked Finding the sum of two numbers knowing only the primes
Jun
19
awarded  Critic
Jun
17
comment Generating all coprime pairs within limits
A and B might go as high as 40000 each or so. Nothing huge, but large enough to get irritating. Generated one by one is okay.
Jun
17
asked Generating all coprime pairs within limits
Jun
13
awarded  Popular Question
Jun
5
awarded  Yearling
May
9
asked Modular arithmetic with decimals
Jan
20
comment What kind of graph is this?
I have a grid of size n by n. I have points on this grid (arbitrary number / position of them). I can only go from one point to another, and I can only go to an immediately visible point that is greater than the one I am currently at in either x, y, or both x and y coordinate.
Jan
20
comment What kind of graph is this?
@CalvinLin So I can convert it to a 1D array representation
Jan
20
asked What kind of graph is this?
Nov
27
comment How to convert this into a single closed form?
Ah I gotcha -- it's (64*(b*(b+1)/2)**2 + 48*(b*(b+1)*(2*b+1)/6) + 32*(b*(b+1)/2) + 6*(b+1))/3 + 2*(b+1). I understand now. Thank you!