Skip to main content
added 8 characters in body
Source Link
Pavel Kozlov
  • 377
  • 1
  • 2
  • 12

From Faulhaber's formula we can see that $S(x,y)*(y+1)*den(\max\{B_y,B_{y-1}\})$$S(x,y)*(y+1)*lcm _{2i\leq y} den (B_{2i})$ is divisible by $x$, so for $x>z*(y+1)*den(\max\{B_y,B_{y-1}\})$$x>z*(y+1)*lcm _{2i\leq y} den (B_{2i})$ our expression $S(x,y)$ gives remainder more than $z$ modulo $x$ provided $z\not =0$.

From Faulhaber's formula we can see that $S(x,y)*(y+1)*den(\max\{B_y,B_{y-1}\})$ is divisible by $x$, so for $x>z*(y+1)*den(\max\{B_y,B_{y-1}\})$ our expression $S(x,y)$ gives remainder more than $z$ modulo $x$ provided $z\not =0$.

From Faulhaber's formula we can see that $S(x,y)*(y+1)*lcm _{2i\leq y} den (B_{2i})$ is divisible by $x$, so for $x>z*(y+1)*lcm _{2i\leq y} den (B_{2i})$ our expression $S(x,y)$ gives remainder more than $z$ modulo $x$ provided $z\not =0$.

Source Link
Pavel Kozlov
  • 377
  • 1
  • 2
  • 12

From Faulhaber's formula we can see that $S(x,y)*(y+1)*den(\max\{B_y,B_{y-1}\})$ is divisible by $x$, so for $x>z*(y+1)*den(\max\{B_y,B_{y-1}\})$ our expression $S(x,y)$ gives remainder more than $z$ modulo $x$ provided $z\not =0$.