Find conditions on $a, b, c$, and $d$ with $ane -1, 0, 1$ such that $dmid(a^n+bn+c)$ for $n ge 1$.
up vote
0
down vote
favorite
This is a generalization of
Using induction, show that $4^n +15n - 1$ is divisible by $9$ for all $n geq 1$
I want to find conditions on
$a, b, c$, and $d$
with
$ane -1, 0, 1$
such that
$dmid(a^n+bn+c)$
for
$n ge 1$.
Here is my result:
A sufficient condition
is that
$a+b+c ne 0$
and
all of
$a+b+c,
b(a-1)$,
and
$c(a-1)-b$
are divisible by $d$.
For the problem
that prompted this,
with
$a=4, b=15, c=-1$,
these are
$18, 45,$
and
$-18$.
sequences-and-series elementary-number-theory divisibility
edited Nov 22 at 10:47
user302797
19.4k92252
asked Nov 16 at 3:56
marty cohen
71.7k546124
add a comment |
up vote
0
down vote
favorite
This is a generalization of
Using induction, show that $4^n +15n - 1$ is divisible by $9$ for all $n geq 1$
I want to find conditions on
$a, b, c$, and $d$
with
$ane -1, 0, 1$
such that
$dmid(a^n+bn+c)$
for
$n ge 1$.
Here is my result:
A sufficient condition
is that
$a+b+c ne 0$
and
all of
$a+b+c,
b(a-1)$,
and
$c(a-1)-b$
are divisible by $d$.
For the problem
that prompted this,
with
$a=4, b=15, c=-1$,
these are
$18, 45,$
and
$-18$.
sequences-and-series elementary-number-theory divisibility
edited Nov 22 at 10:47
user302797
19.4k92252
asked Nov 16 at 3:56
marty cohen
71.7k546124
1
This is a dupe (of at least a couple threads)
– Bill Dubuque
Nov 16 at 4:29
Wouldn't be surprised. Might even be a dupe of myself, the way my memory works. Anyway, I worked this out just today completely independently. If you find the dupe, I'll upvote you. What the heck, I'll upvote you anyway.
– marty cohen
Nov 16 at 5:11
2
I found a couple, e.g. here and here. There are likely more.
– Bill Dubuque
Nov 16 at 15:35
I have done this as an excercise of induction. I think it will be hard to find the conditions.
– OppoInfinity
Nov 19 at 4:33
add a comment |
up vote
0
down vote
favorite
up vote
0
down vote
favorite
This is a generalization of
Using induction, show that $4^n +15n - 1$ is divisible by $9$ for all $n geq 1$
I want to find conditions on
$a, b, c$, and $d$
with
$ane -1, 0, 1$
such that
$dmid(a^n+bn+c)$
for
$n ge 1$.
Here is my result:
A sufficient condition
is that
$a+b+c ne 0$
and
all of
$a+b+c,
b(a-1)$,
and
$c(a-1)-b$
are divisible by $d$.
For the problem
that prompted this,
with
$a=4, b=15, c=-1$,
these are
$18, 45,$
and
$-18$.
sequences-and-series elementary-number-theory divisibility
edited Nov 22 at 10:47
user302797
19.4k92252
asked Nov 16 at 3:56
marty cohen
71.7k546124
This is a generalization of
Using induction, show that $4^n +15n - 1$ is divisible by $9$ for all $n geq 1$
I want to find conditions on
$a, b, c$, and $d$
with
$ane -1, 0, 1$
such that
$dmid(a^n+bn+c)$
for
$n ge 1$.
Here is my result:
A sufficient condition
is that
$a+b+c ne 0$
and
all of
$a+b+c,
b(a-1)$,
and
$c(a-1)-b$
are divisible by $d$.
For the problem
that prompted this,
with
$a=4, b=15, c=-1$,
these are
$18, 45,$
and
$-18$.
sequences-and-series elementary-number-theory divisibility
sequences-and-series elementary-number-theory divisibility
edited Nov 22 at 10:47
user302797
19.4k92252
asked Nov 16 at 3:56
marty cohen
71.7k546124
edited Nov 22 at 10:47
user302797
19.4k92252
asked Nov 16 at 3:56
marty cohen
71.7k546124
edited Nov 22 at 10:47
user302797
19.4k92252
edited Nov 22 at 10:47
user302797
19.4k92252
edited Nov 22 at 10:47
user302797
19.4k92252
19.4k92252
asked Nov 16 at 3:56
marty cohen
71.7k546124
asked Nov 16 at 3:56
marty cohen
71.7k546124
asked Nov 16 at 3:56
marty cohen
71.7k546124
71.7k546124
1
This is a dupe (of at least a couple threads)
– Bill Dubuque
Nov 16 at 4:29
Wouldn't be surprised. Might even be a dupe of myself, the way my memory works. Anyway, I worked this out just today completely independently. If you find the dupe, I'll upvote you. What the heck, I'll upvote you anyway.
– marty cohen
Nov 16 at 5:11
2
I found a couple, e.g. here and here. There are likely more.
– Bill Dubuque
Nov 16 at 15:35
I have done this as an excercise of induction. I think it will be hard to find the conditions.
– OppoInfinity
Nov 19 at 4:33
add a comment |
1
This is a dupe (of at least a couple threads)
– Bill Dubuque
Nov 16 at 4:29
Wouldn't be surprised. Might even be a dupe of myself, the way my memory works. Anyway, I worked this out just today completely independently. If you find the dupe, I'll upvote you. What the heck, I'll upvote you anyway.
– marty cohen
Nov 16 at 5:11
2
I found a couple, e.g. here and here. There are likely more.
– Bill Dubuque
Nov 16 at 15:35
I have done this as an excercise of induction. I think it will be hard to find the conditions.
– OppoInfinity
Nov 19 at 4:33
1
1
This is a dupe (of at least a couple threads)
– Bill Dubuque
Nov 16 at 4:29
This is a dupe (of at least a couple threads)
– Bill Dubuque
Nov 16 at 4:29
Wouldn't be surprised. Might even be a dupe of myself, the way my memory works. Anyway, I worked this out just today completely independently. If you find the dupe, I'll upvote you. What the heck, I'll upvote you anyway.
– marty cohen
Nov 16 at 5:11
Wouldn't be surprised. Might even be a dupe of myself, the way my memory works. Anyway, I worked this out just today completely independently. If you find the dupe, I'll upvote you. What the heck, I'll upvote you anyway.
– marty cohen
Nov 16 at 5:11
2
2
I found a couple, e.g. here and here. There are likely more.
– Bill Dubuque
Nov 16 at 15:35
I found a couple, e.g. here and here. There are likely more.
– Bill Dubuque
Nov 16 at 15:35
I have done this as an excercise of induction. I think it will be hard to find the conditions.
– OppoInfinity
Nov 19 at 4:33
I have done this as an excercise of induction. I think it will be hard to find the conditions.
– OppoInfinity
Nov 19 at 4:33
add a comment |
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3000696%2ffind-conditions-on-a-b-c-and-d-with-a-ne-1-0-1-such-that-d-midan%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
1
This is a dupe (of at least a couple threads)
– Bill Dubuque
Nov 16 at 4:29
Wouldn't be surprised. Might even be a dupe of myself, the way my memory works. Anyway, I worked this out just today completely independently. If you find the dupe, I'll upvote you. What the heck, I'll upvote you anyway.
– marty cohen
Nov 16 at 5:11
2
I found a couple, e.g. here and here. There are likely more.
– Bill Dubuque
Nov 16 at 15:35
I have done this as an excercise of induction. I think it will be hard to find the conditions.
– OppoInfinity
Nov 19 at 4:33