Modulus with divisor unknown












0














I'm trying to find the answer to this question, but more importantly, a general formula.




$x$ is a positive integer which solves the following questions: when $280$ is divided by $x$, the remainder is $16$; when $900$ is divided by $x$, the remainder is $42$. Find the greatest possible value of $x$.




It's quite obvious that $43leq xleq264$, and I've converted the above into the equations $280=kx+16$ and $900=mx+42$. I'm not sure how to proceed further.






algebra-precalculus modular-arithmetic







share|cite|improve this question






















  • Is my answer right? Please check once .
    – Akash Roy
    Nov 27 at 14:07
















0














I'm trying to find the answer to this question, but more importantly, a general formula.




$x$ is a positive integer which solves the following questions: when $280$ is divided by $x$, the remainder is $16$; when $900$ is divided by $x$, the remainder is $42$. Find the greatest possible value of $x$.




It's quite obvious that $43leq xleq264$, and I've converted the above into the equations $280=kx+16$ and $900=mx+42$. I'm not sure how to proceed further.






algebra-precalculus modular-arithmetic







share|cite|improve this question






















  • Is my answer right? Please check once .
    – Akash Roy
    Nov 27 at 14:07














0












0








0







I'm trying to find the answer to this question, but more importantly, a general formula.




$x$ is a positive integer which solves the following questions: when $280$ is divided by $x$, the remainder is $16$; when $900$ is divided by $x$, the remainder is $42$. Find the greatest possible value of $x$.




It's quite obvious that $43leq xleq264$, and I've converted the above into the equations $280=kx+16$ and $900=mx+42$. I'm not sure how to proceed further.






algebra-precalculus modular-arithmetic







share|cite|improve this question













I'm trying to find the answer to this question, but more importantly, a general formula.




$x$ is a positive integer which solves the following questions: when $280$ is divided by $x$, the remainder is $16$; when $900$ is divided by $x$, the remainder is $42$. Find the greatest possible value of $x$.




It's quite obvious that $43leq xleq264$, and I've converted the above into the equations $280=kx+16$ and $900=mx+42$. I'm not sure how to proceed further.






algebra-precalculus modular-arithmetic




algebra-precalculus modular-arithmetic






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Nov 27 at 13:07









Kyky

444213




444213












  • Is my answer right? Please check once .
    – Akash Roy
    Nov 27 at 14:07


















  • Is my answer right? Please check once .
    – Akash Roy
    Nov 27 at 14:07
















Is my answer right? Please check once .
– Akash Roy
Nov 27 at 14:07




Is my answer right? Please check once .
– Akash Roy
Nov 27 at 14:07










3 Answers
3






active

oldest

votes


















3














From $280 = kx + 16$ and $900 = mx + 42$, simple transpositions give us $858 = mx$ and $264 = kx$. Thus, $x$ is a divisor of $858$ and $264$. What is the greatest such divisor?(Think : greatest common divisor). Do you know a "general" procedure for finding the greatest common divisor?



Do you think that this satisfies the conditions of the question, and is the largest such number to do so?






share|cite|improve this answer





















  • Thanks! I'm surprised I haven't come up with the answer myself now that I think of it.
    – Kyky
    Nov 27 at 13:14










  • Actually, I should point out : suppose this gcd were less than $42$, then the remainder upon division cannot be $42$. So we are restricted to divisors of $264$ which are greater than $42$, and there are not too many to check, so in this case one need not even go through the Euclidean algorithm.
    – астон вілла олоф мэллбэрг
    Nov 27 at 13:19



















0














Hint:



When $280$ is divided by $x$, the remainder is $16$. What does this tell you about the remainder when $280 - 16$ is divided by $x$?






share|cite|improve this answer





















  • Is my answer right?
    – Akash Roy
    Nov 27 at 14:08



















0














The number which you are looking for has to be the HCF of $858$ and $264$ because the two conditions have to be fulfilled simultaneously. Thus the answer is $66$. You can use Euclid Algorithm or Prime factorization method to find HCF.



Note : HCF denotes Highest Common Factor






share|cite|improve this answer























  • HCF? What is HCF?
    – 5xum
    Nov 27 at 17:06










  • Highest common factor @5xum or Greatest common divisor
    – Akash Roy
    Nov 27 at 17:07










  • Is the answer right?
    – Akash Roy
    Nov 27 at 17:08










  • It's correct, but I think we should spare the extra 1.5 seconds to write out ambiguous abreviations such as HCF...
    – 5xum
    Nov 27 at 17:30










  • Should I replace it with GCD?
    – Akash Roy
    Nov 27 at 17:31











Your Answer





StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3015746%2fmodulus-with-divisor-unknown%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























3 Answers
3






active

oldest

votes








3 Answers
3






active

oldest

votes









active

oldest

votes






active

oldest

votes









3














From $280 = kx + 16$ and $900 = mx + 42$, simple transpositions give us $858 = mx$ and $264 = kx$. Thus, $x$ is a divisor of $858$ and $264$. What is the greatest such divisor?(Think : greatest common divisor). Do you know a "general" procedure for finding the greatest common divisor?



Do you think that this satisfies the conditions of the question, and is the largest such number to do so?






share|cite|improve this answer





















  • Thanks! I'm surprised I haven't come up with the answer myself now that I think of it.
    – Kyky
    Nov 27 at 13:14










  • Actually, I should point out : suppose this gcd were less than $42$, then the remainder upon division cannot be $42$. So we are restricted to divisors of $264$ which are greater than $42$, and there are not too many to check, so in this case one need not even go through the Euclidean algorithm.
    – астон вілла олоф мэллбэрг
    Nov 27 at 13:19
















3














From $280 = kx + 16$ and $900 = mx + 42$, simple transpositions give us $858 = mx$ and $264 = kx$. Thus, $x$ is a divisor of $858$ and $264$. What is the greatest such divisor?(Think : greatest common divisor). Do you know a "general" procedure for finding the greatest common divisor?



Do you think that this satisfies the conditions of the question, and is the largest such number to do so?






share|cite|improve this answer





















  • Thanks! I'm surprised I haven't come up with the answer myself now that I think of it.
    – Kyky
    Nov 27 at 13:14










  • Actually, I should point out : suppose this gcd were less than $42$, then the remainder upon division cannot be $42$. So we are restricted to divisors of $264$ which are greater than $42$, and there are not too many to check, so in this case one need not even go through the Euclidean algorithm.
    – астон вілла олоф мэллбэрг
    Nov 27 at 13:19














3












3








3






From $280 = kx + 16$ and $900 = mx + 42$, simple transpositions give us $858 = mx$ and $264 = kx$. Thus, $x$ is a divisor of $858$ and $264$. What is the greatest such divisor?(Think : greatest common divisor). Do you know a "general" procedure for finding the greatest common divisor?



Do you think that this satisfies the conditions of the question, and is the largest such number to do so?






share|cite|improve this answer












From $280 = kx + 16$ and $900 = mx + 42$, simple transpositions give us $858 = mx$ and $264 = kx$. Thus, $x$ is a divisor of $858$ and $264$. What is the greatest such divisor?(Think : greatest common divisor). Do you know a "general" procedure for finding the greatest common divisor?



Do you think that this satisfies the conditions of the question, and is the largest such number to do so?







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered Nov 27 at 13:11









астон вілла олоф мэллбэрг

37.2k33376




37.2k33376












  • Thanks! I'm surprised I haven't come up with the answer myself now that I think of it.
    – Kyky
    Nov 27 at 13:14










  • Actually, I should point out : suppose this gcd were less than $42$, then the remainder upon division cannot be $42$. So we are restricted to divisors of $264$ which are greater than $42$, and there are not too many to check, so in this case one need not even go through the Euclidean algorithm.
    – астон вілла олоф мэллбэрг
    Nov 27 at 13:19


















  • Thanks! I'm surprised I haven't come up with the answer myself now that I think of it.
    – Kyky
    Nov 27 at 13:14










  • Actually, I should point out : suppose this gcd were less than $42$, then the remainder upon division cannot be $42$. So we are restricted to divisors of $264$ which are greater than $42$, and there are not too many to check, so in this case one need not even go through the Euclidean algorithm.
    – астон вілла олоф мэллбэрг
    Nov 27 at 13:19
















Thanks! I'm surprised I haven't come up with the answer myself now that I think of it.
– Kyky
Nov 27 at 13:14




Thanks! I'm surprised I haven't come up with the answer myself now that I think of it.
– Kyky
Nov 27 at 13:14












Actually, I should point out : suppose this gcd were less than $42$, then the remainder upon division cannot be $42$. So we are restricted to divisors of $264$ which are greater than $42$, and there are not too many to check, so in this case one need not even go through the Euclidean algorithm.
– астон вілла олоф мэллбэрг
Nov 27 at 13:19




Actually, I should point out : suppose this gcd were less than $42$, then the remainder upon division cannot be $42$. So we are restricted to divisors of $264$ which are greater than $42$, and there are not too many to check, so in this case one need not even go through the Euclidean algorithm.
– астон вілла олоф мэллбэрг
Nov 27 at 13:19











0














Hint:



When $280$ is divided by $x$, the remainder is $16$. What does this tell you about the remainder when $280 - 16$ is divided by $x$?






share|cite|improve this answer





















  • Is my answer right?
    – Akash Roy
    Nov 27 at 14:08
















0














Hint:



When $280$ is divided by $x$, the remainder is $16$. What does this tell you about the remainder when $280 - 16$ is divided by $x$?






share|cite|improve this answer





















  • Is my answer right?
    – Akash Roy
    Nov 27 at 14:08














0












0








0






Hint:



When $280$ is divided by $x$, the remainder is $16$. What does this tell you about the remainder when $280 - 16$ is divided by $x$?






share|cite|improve this answer












Hint:



When $280$ is divided by $x$, the remainder is $16$. What does this tell you about the remainder when $280 - 16$ is divided by $x$?







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered Nov 27 at 13:11









5xum

89.5k393161




89.5k393161












  • Is my answer right?
    – Akash Roy
    Nov 27 at 14:08


















  • Is my answer right?
    – Akash Roy
    Nov 27 at 14:08
















Is my answer right?
– Akash Roy
Nov 27 at 14:08




Is my answer right?
– Akash Roy
Nov 27 at 14:08











0














The number which you are looking for has to be the HCF of $858$ and $264$ because the two conditions have to be fulfilled simultaneously. Thus the answer is $66$. You can use Euclid Algorithm or Prime factorization method to find HCF.



Note : HCF denotes Highest Common Factor






share|cite|improve this answer























  • HCF? What is HCF?
    – 5xum
    Nov 27 at 17:06










  • Highest common factor @5xum or Greatest common divisor
    – Akash Roy
    Nov 27 at 17:07










  • Is the answer right?
    – Akash Roy
    Nov 27 at 17:08










  • It's correct, but I think we should spare the extra 1.5 seconds to write out ambiguous abreviations such as HCF...
    – 5xum
    Nov 27 at 17:30










  • Should I replace it with GCD?
    – Akash Roy
    Nov 27 at 17:31
















0














The number which you are looking for has to be the HCF of $858$ and $264$ because the two conditions have to be fulfilled simultaneously. Thus the answer is $66$. You can use Euclid Algorithm or Prime factorization method to find HCF.



Note : HCF denotes Highest Common Factor






share|cite|improve this answer























  • HCF? What is HCF?
    – 5xum
    Nov 27 at 17:06










  • Highest common factor @5xum or Greatest common divisor
    – Akash Roy
    Nov 27 at 17:07










  • Is the answer right?
    – Akash Roy
    Nov 27 at 17:08










  • It's correct, but I think we should spare the extra 1.5 seconds to write out ambiguous abreviations such as HCF...
    – 5xum
    Nov 27 at 17:30










  • Should I replace it with GCD?
    – Akash Roy
    Nov 27 at 17:31














0












0








0






The number which you are looking for has to be the HCF of $858$ and $264$ because the two conditions have to be fulfilled simultaneously. Thus the answer is $66$. You can use Euclid Algorithm or Prime factorization method to find HCF.



Note : HCF denotes Highest Common Factor






share|cite|improve this answer














The number which you are looking for has to be the HCF of $858$ and $264$ because the two conditions have to be fulfilled simultaneously. Thus the answer is $66$. You can use Euclid Algorithm or Prime factorization method to find HCF.



Note : HCF denotes Highest Common Factor







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited Nov 27 at 17:08

























answered Nov 27 at 13:35









Akash Roy

1




1












  • HCF? What is HCF?
    – 5xum
    Nov 27 at 17:06










  • Highest common factor @5xum or Greatest common divisor
    – Akash Roy
    Nov 27 at 17:07










  • Is the answer right?
    – Akash Roy
    Nov 27 at 17:08










  • It's correct, but I think we should spare the extra 1.5 seconds to write out ambiguous abreviations such as HCF...
    – 5xum
    Nov 27 at 17:30










  • Should I replace it with GCD?
    – Akash Roy
    Nov 27 at 17:31


















  • HCF? What is HCF?
    – 5xum
    Nov 27 at 17:06










  • Highest common factor @5xum or Greatest common divisor
    – Akash Roy
    Nov 27 at 17:07










  • Is the answer right?
    – Akash Roy
    Nov 27 at 17:08










  • It's correct, but I think we should spare the extra 1.5 seconds to write out ambiguous abreviations such as HCF...
    – 5xum
    Nov 27 at 17:30










  • Should I replace it with GCD?
    – Akash Roy
    Nov 27 at 17:31
















HCF? What is HCF?
– 5xum
Nov 27 at 17:06




HCF? What is HCF?
– 5xum
Nov 27 at 17:06












Highest common factor @5xum or Greatest common divisor
– Akash Roy
Nov 27 at 17:07




Highest common factor @5xum or Greatest common divisor
– Akash Roy
Nov 27 at 17:07












Is the answer right?
– Akash Roy
Nov 27 at 17:08




Is the answer right?
– Akash Roy
Nov 27 at 17:08












It's correct, but I think we should spare the extra 1.5 seconds to write out ambiguous abreviations such as HCF...
– 5xum
Nov 27 at 17:30




It's correct, but I think we should spare the extra 1.5 seconds to write out ambiguous abreviations such as HCF...
– 5xum
Nov 27 at 17:30












Should I replace it with GCD?
– Akash Roy
Nov 27 at 17:31




Should I replace it with GCD?
– Akash Roy
Nov 27 at 17:31


















draft saved

draft discarded




















































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.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3015746%2fmodulus-with-divisor-unknown%23new-answer', 'question_page');
}
);

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







-

Popular posts from this blog

Probability when a professor distributes a quiz and homework assignment to a class of n students.

Image
0 0 $begingroup$ Need help with this problem. Suppose our lazy professor collects a quiz and a homework assignment from a class of n students one day, then distributes both the quizzes and the homework assignments back to the class in a random fashion for grading. Each student receives one quiz and one homework assignment to grade. (a) What is the probability that every student receives someone else's quiz to grade, and someone else's homework to grade? (b) What is the probability that no student receives both their own quiz and their own homework assignment to grade? In this case, some students may receive their own quiz, and others may receive their own homework assignment. (c) Compute the limiting probability as n approaches infinity in each case. ...
Read more

Aardman Animations

Image
Aardman Animations, Ltd. Aardman Animations Tipo privada Atividade Animação em stop-motion , Animação em CGI Fundação 1972 Fundador(es) Peter Lord David Sproxton Sede Bristol, Inglaterra  Reino Unido Proprietário(s) Dreamworks Pessoas-chave Peter Lord David Sproxton Nick Park Divisões Aardman Features Aardman Digital Aardman Commercials Aardman Broadcast Aardman International Aardman Rights Aardman Effects Aardman 3-D Systems Aardman Nathan Love AardBoiled Website oficial aardman.com ...
Read more

Are they similar matrix

Image
0 $begingroup$ Do $begin{bmatrix} 0&i&0\0&0&1\0&0&0 end{bmatrix} $ and $begin{bmatrix} 0&0&0\-i&0&0\0&1&0 end{bmatrix} $ are similar.Is this True/false Clearly both are nilpotent and one is conjucate transpose of other but how to know if they are similar.i'm stuck. Please help me linear-algebra vector-spaces eigenvalues-eigenvectors generalizedeigenvector share | cite | improve this question edited Dec 10 '18 at 6:38 Vasanth Kris asked Dec 10 '18 at 6:19 ...
Read more