A Diophantine rational function [closed]Solve for $n$ and $m$ [exponents]Should the angels play their game?Repunit replicationRed, yellow and orange numbersCan you identify this function?Inequality with strange equality conditionsCan powers sum to rational squares?A strange computer programming language
refreshApex in lwc doesn't seem to work
Can a stolen Android phone with USB debugging enabled have screen lock bypassed?
Why is macOS limited to 1064 processes?
How to initiate a conversation with a person who recently had transition but you were not in touch with them?
Yarok and Animate Dead
Disable the use of the "com.apple.quarantine" extended attribute on Mojave
Uncooked peppers and garlic in olive oil fizzled when opened
Reviewer wants me to do massive amount of work, the result would be a different article. Should I tell that to the editor?
Why does Docker hub allow non-official Docker images and why do they exist?
How much transparency about runway should I expect from startup employer?
Are there any spells that aren't on any class's spell list?
Electric field due to a hydrogen atom
How to name the thing that has components?
Multiple devices with one IPv6 to the Internet?
Why combine commands on a single line in Bash script?
Is is likely that my lack of post-secondary education is holding my resume back?
How can I determine if two vertices on a polygon are consecutive?
Why do the expressions for an object rolling down an incline not depend on the coefficient of static friction?
Is exploit-free software possible?
Radar Altimeter in Space Shuttle
How does a manufacturer determine the warranty for the battery?
How do I build a kernel using patches from LKML?
Is velocity a valid measure of team and process improvement?
Mysql - Average price for top 10% cheapest volume (algorithm help)
A Diophantine rational function [closed]
Solve for $n$ and $m$ [exponents]Should the angels play their game?Repunit replicationRed, yellow and orange numbersCan you identify this function?Inequality with strange equality conditionsCan powers sum to rational squares?A strange computer programming language
.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty
margin-bottom:0;
.everyonelovesstackoverflowposition:absolute;height:1px;width:1px;opacity:0;top:0;left:0;pointer-events:none;
$begingroup$
For how many integers $N$ is the rational function $fracN^2-2N-15N^2-N-12$ also an integer?
mathematics
$endgroup$
closed as off-topic by greenturtle3141, Brandon_J, gabbo1092, Gamow, Glorfindel Jun 6 at 19:53
This question appears to be off-topic. The users who voted to close gave this specific reason:
- "This question is off-topic as it appears to be a mathematics problem, as opposed to a mathematical puzzle. For more info, see "Are math-textbook-style problems on topic?" on meta." – greenturtle3141, Brandon_J, gabbo1092, Gamow, Glorfindel
add a comment
|
$begingroup$
For how many integers $N$ is the rational function $fracN^2-2N-15N^2-N-12$ also an integer?
mathematics
$endgroup$
closed as off-topic by greenturtle3141, Brandon_J, gabbo1092, Gamow, Glorfindel Jun 6 at 19:53
This question appears to be off-topic. The users who voted to close gave this specific reason:
- "This question is off-topic as it appears to be a mathematics problem, as opposed to a mathematical puzzle. For more info, see "Are math-textbook-style problems on topic?" on meta." – greenturtle3141, Brandon_J, gabbo1092, Gamow, Glorfindel
$begingroup$
I don't think this is off-topic. The "obvious" way to approach this would be to write $N^2−2N−15=M(N^2−N−12)$ and then try to reduce possibilities for $M$ and $N$, perhaps by using modular arithmetic or even brute-forcing. The "aha moment" required by the linked policy is to factorise the polynomials, and the "unexpected result" is that only two values of $N$ work and it's easy to find which ones.
$endgroup$
– Rand al'Thor
Jun 7 at 13:02
add a comment
|
$begingroup$
For how many integers $N$ is the rational function $fracN^2-2N-15N^2-N-12$ also an integer?
mathematics
$endgroup$
For how many integers $N$ is the rational function $fracN^2-2N-15N^2-N-12$ also an integer?
mathematics
mathematics
asked Jun 6 at 9:53
Rand al'ThorRand al'Thor
76.7k15 gold badges252 silver badges506 bronze badges
76.7k15 gold badges252 silver badges506 bronze badges
closed as off-topic by greenturtle3141, Brandon_J, gabbo1092, Gamow, Glorfindel Jun 6 at 19:53
This question appears to be off-topic. The users who voted to close gave this specific reason:
- "This question is off-topic as it appears to be a mathematics problem, as opposed to a mathematical puzzle. For more info, see "Are math-textbook-style problems on topic?" on meta." – greenturtle3141, Brandon_J, gabbo1092, Gamow, Glorfindel
closed as off-topic by greenturtle3141, Brandon_J, gabbo1092, Gamow, Glorfindel Jun 6 at 19:53
This question appears to be off-topic. The users who voted to close gave this specific reason:
- "This question is off-topic as it appears to be a mathematics problem, as opposed to a mathematical puzzle. For more info, see "Are math-textbook-style problems on topic?" on meta." – greenturtle3141, Brandon_J, gabbo1092, Gamow, Glorfindel
closed as off-topic by greenturtle3141, Brandon_J, gabbo1092, Gamow, Glorfindel Jun 6 at 19:53
This question appears to be off-topic. The users who voted to close gave this specific reason:
- "This question is off-topic as it appears to be a mathematics problem, as opposed to a mathematical puzzle. For more info, see "Are math-textbook-style problems on topic?" on meta." – greenturtle3141, Brandon_J, gabbo1092, Gamow, Glorfindel
$begingroup$
I don't think this is off-topic. The "obvious" way to approach this would be to write $N^2−2N−15=M(N^2−N−12)$ and then try to reduce possibilities for $M$ and $N$, perhaps by using modular arithmetic or even brute-forcing. The "aha moment" required by the linked policy is to factorise the polynomials, and the "unexpected result" is that only two values of $N$ work and it's easy to find which ones.
$endgroup$
– Rand al'Thor
Jun 7 at 13:02
add a comment
|
$begingroup$
I don't think this is off-topic. The "obvious" way to approach this would be to write $N^2−2N−15=M(N^2−N−12)$ and then try to reduce possibilities for $M$ and $N$, perhaps by using modular arithmetic or even brute-forcing. The "aha moment" required by the linked policy is to factorise the polynomials, and the "unexpected result" is that only two values of $N$ work and it's easy to find which ones.
$endgroup$
– Rand al'Thor
Jun 7 at 13:02
$begingroup$
I don't think this is off-topic. The "obvious" way to approach this would be to write $N^2−2N−15=M(N^2−N−12)$ and then try to reduce possibilities for $M$ and $N$, perhaps by using modular arithmetic or even brute-forcing. The "aha moment" required by the linked policy is to factorise the polynomials, and the "unexpected result" is that only two values of $N$ work and it's easy to find which ones.
$endgroup$
– Rand al'Thor
Jun 7 at 13:02
$begingroup$
I don't think this is off-topic. The "obvious" way to approach this would be to write $N^2−2N−15=M(N^2−N−12)$ and then try to reduce possibilities for $M$ and $N$, perhaps by using modular arithmetic or even brute-forcing. The "aha moment" required by the linked policy is to factorise the polynomials, and the "unexpected result" is that only two values of $N$ work and it's easy to find which ones.
$endgroup$
– Rand al'Thor
Jun 7 at 13:02
add a comment
|
1 Answer
1
active
oldest
votes
$begingroup$
Since the given expression can be simplified to
$frac(N-5)(N+3)(N-4)(N+3)=fracN-5N-4=1-frac1N-4$,
we simply need to make sure
$N-4$ divides $1$, i.e., $N-4=pm 1$, which leads to $N=5$ or $N=3$. We can check that both of them work.
So
There are two such $N$.
$endgroup$
$begingroup$
Perfect! I was hoping to lead people on a wild goose chase with $N^2-2N-15=M(N^2-N-12)$ or suchlike, but you're too good.
$endgroup$
– Rand al'Thor
Jun 6 at 10:09
add a comment
|
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Since the given expression can be simplified to
$frac(N-5)(N+3)(N-4)(N+3)=fracN-5N-4=1-frac1N-4$,
we simply need to make sure
$N-4$ divides $1$, i.e., $N-4=pm 1$, which leads to $N=5$ or $N=3$. We can check that both of them work.
So
There are two such $N$.
$endgroup$
$begingroup$
Perfect! I was hoping to lead people on a wild goose chase with $N^2-2N-15=M(N^2-N-12)$ or suchlike, but you're too good.
$endgroup$
– Rand al'Thor
Jun 6 at 10:09
add a comment
|
$begingroup$
Since the given expression can be simplified to
$frac(N-5)(N+3)(N-4)(N+3)=fracN-5N-4=1-frac1N-4$,
we simply need to make sure
$N-4$ divides $1$, i.e., $N-4=pm 1$, which leads to $N=5$ or $N=3$. We can check that both of them work.
So
There are two such $N$.
$endgroup$
$begingroup$
Perfect! I was hoping to lead people on a wild goose chase with $N^2-2N-15=M(N^2-N-12)$ or suchlike, but you're too good.
$endgroup$
– Rand al'Thor
Jun 6 at 10:09
add a comment
|
$begingroup$
Since the given expression can be simplified to
$frac(N-5)(N+3)(N-4)(N+3)=fracN-5N-4=1-frac1N-4$,
we simply need to make sure
$N-4$ divides $1$, i.e., $N-4=pm 1$, which leads to $N=5$ or $N=3$. We can check that both of them work.
So
There are two such $N$.
$endgroup$
Since the given expression can be simplified to
$frac(N-5)(N+3)(N-4)(N+3)=fracN-5N-4=1-frac1N-4$,
we simply need to make sure
$N-4$ divides $1$, i.e., $N-4=pm 1$, which leads to $N=5$ or $N=3$. We can check that both of them work.
So
There are two such $N$.
answered Jun 6 at 10:03
AnkoganitAnkoganit
11.9k3 gold badges58 silver badges112 bronze badges
11.9k3 gold badges58 silver badges112 bronze badges
$begingroup$
Perfect! I was hoping to lead people on a wild goose chase with $N^2-2N-15=M(N^2-N-12)$ or suchlike, but you're too good.
$endgroup$
– Rand al'Thor
Jun 6 at 10:09
add a comment
|
$begingroup$
Perfect! I was hoping to lead people on a wild goose chase with $N^2-2N-15=M(N^2-N-12)$ or suchlike, but you're too good.
$endgroup$
– Rand al'Thor
Jun 6 at 10:09
$begingroup$
Perfect! I was hoping to lead people on a wild goose chase with $N^2-2N-15=M(N^2-N-12)$ or suchlike, but you're too good.
$endgroup$
– Rand al'Thor
Jun 6 at 10:09
$begingroup$
Perfect! I was hoping to lead people on a wild goose chase with $N^2-2N-15=M(N^2-N-12)$ or suchlike, but you're too good.
$endgroup$
– Rand al'Thor
Jun 6 at 10:09
add a comment
|
$begingroup$
I don't think this is off-topic. The "obvious" way to approach this would be to write $N^2−2N−15=M(N^2−N−12)$ and then try to reduce possibilities for $M$ and $N$, perhaps by using modular arithmetic or even brute-forcing. The "aha moment" required by the linked policy is to factorise the polynomials, and the "unexpected result" is that only two values of $N$ work and it's easy to find which ones.
$endgroup$
– Rand al'Thor
Jun 7 at 13:02