meta user
network profile
| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 11 months |
| seen | May 9 at 18:19 | |
| stats | profile views | 75 |
|
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! |
|
Nov 27 |
comment |
How to convert this into a single closed form? so with p=4i+1, is the sum (64*(b*(b+1)/2)**2 + 48*(b*(b+1)*(2*b+1)/6) + 32*(b*(b+1)/2) + 22*b)/3 + 3*b? Getting the wrong answer despite following this method |
|
Nov 26 |
accepted | How to convert this into a single closed form? |
|
Nov 26 |
comment |
How to convert this into a single closed form? Is there any way to generalize this to arbitrary p (maybe in another equation p=5i+6 instead, etc)? I'll accept this as answer anyway in the meantime, just curious |
|
Nov 26 |
comment |
How to convert this into a single closed form? I made that comment before your final edit; checking it now |
|
Nov 26 |
comment |
How to convert this into a single closed form? This is not technically a closed form expression. Closed form means the only variable involved should be $b$, without loops. $i$ is an iterator variable that only makes sense in the context of a loop. |
|
Nov 26 |
asked | How to convert this into a single closed form? |
|
Nov 26 |
comment |
Determining thresholds based on value of variable Wouldn't the last one be minus plus-or-minus k(2mn)? So how would I go about actually generating these triples in a systematic way, and how would I know the boundary conditions? |
|
Nov 26 |
asked | Determining thresholds based on value of variable |
|
Nov 25 |
accepted | Generating valid x and y that result in perfect squares |
|
Nov 25 |
comment |
Generating valid x and y that result in perfect squares how do you get that z is bound by N+1? z^2=n^2+4n has solution z = +/- sqrt(n)sqrt(n+4) |
|
Nov 25 |
asked | Generating valid x and y that result in perfect squares |
|
Nov 24 |
awarded | Citizen Patrol |
|
Nov 21 |
accepted | Is there a closed form equation for fibonacci(n) modulo m? |
|
Nov 20 |
asked | Is there a closed form equation for fibonacci(n) modulo m? |
|
Nov 19 |
comment |
Are there programs out there that try to derive linear recurrence given a string of numbers? I did. However, I also tried this method with my current sequence and the numbers got bigger instead of smaller for some reason. |
