Timeline for Subdividing a sequence such that sum is somewhat equally distributed
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 29, 2020 at 1:44 | comment | added | Dror Speiser | For $M=4$ and n divisible by 8 such that $n+1$ is prime, it's an exercise to show that dividing $[1...n]$ into their quartic Jacobi symbols mod $p$ gives equal sums. Meaning, you can take the $(p-1)/4$-th power of each number mod $p$, and assign a processor for each of the four possible results. If $n$ doesn't satisfy the requirement, then find the largest prime less than $n$ that is $1\mod{8}$, apply the procedure, and you're left with $O(log(n)^2)$ terms of size $O(n)$ (assuming Cramer's hypothesis), which are negligible in comparison to the $O(n^2)$ work you have. | |
| Apr 26, 2020 at 21:18 | vote | accept | user1775614 | ||
| Apr 26, 2020 at 20:56 | comment | added | user1775614 | So this is actually a programming thing where I have to split the jobs to processors. I don't know the value of n upfront and I am just trying to optimize the utilization of all processors. Somewhat same is me trying to make sure all the processors spend time and it doesn;t overload one processor while the other is sitting free. unfortunately that;s all i got. | |
| Apr 25, 2020 at 23:35 | review | Close votes | |||
| Apr 29, 2020 at 16:13 | |||||
| Apr 25, 2020 at 23:20 | answer | added | RobPratt | timeline score: 2 | |
| Apr 25, 2020 at 23:09 | comment | added | Gerry Myerson | This will be hard to answer, unless you tell us precisely what "somewhat the same", "somewhat close". "approximately split" mean. Arnold Ross used to ask, rhetorically, "What's an approximation to five?" and the correct answer was "any number but five". | |
| Apr 25, 2020 at 22:06 | review | First posts | |||
| Apr 25, 2020 at 23:14 | |||||
| Apr 25, 2020 at 21:58 | history | asked | user1775614 | CC BY-SA 4.0 |