|Nov18-12, 12:36 PM||#1|
Trying to find a simpler way to calculate this function
let P(n) = n^4 + an^3 + bn^2 + cn
M(a,b,c) returns largest m that divides P(n) for all n
then let function S(N) return the sum of all M(a,b,c) for 1 <= a,b,c <= N
I am trying to understand a simpler way to calculate S(N) so I don't have to actually process every single combination of a,b, and c but I am having trouble finding patterns to take advantage of on a broad scale.
So far I know from trying all sorts of values that M(a,b,c) tends to return values of form 2^i * 3^j where i,j>=0.
|Nov18-12, 02:01 PM||#2|
If m divides P(n) for all n, it also divides all differences: m divides P(2)-P(1) = 15+7a+3b, for example.
Using more values for n, you can eliminate more variables. This could help to reduce testing.
|Similar Threads for: Trying to find a simpler way to calculate this function|
|How to calculate the stream function from the potential function?||Classical Physics||0|
|Is there a simpler way to calculate this limit?||Calculus & Beyond Homework||6|
|How to find the transfer function (frequency response function) given the EOM||Mechanical Engineering||1|
|Find the marginal profit function given a function for demand and cost||Calculus & Beyond Homework||3|
|Find if a function is the Laplace transform of a periodic function||Calculus & Beyond Homework||5|