Given a three digit number $n$, let $f(n)$ be the sum of digits of $n$, their products in pairs, and the...











up vote
3
down vote

favorite
1












This is my first time posting so do correct me if I am doing anything wrong.



Please help me with this math problem from the British Maths Olympiad (1994 British Maths Olympiad1 Q1 Number Theory).




Starting with any three digit number $n$ (such as $n = 625$) we obtain a new number $f(n)$ which is equal to the sum of the three digits of $n$, their three products in pairs, and the product of all three digits.
Find all three digit numbers such that $frac{n}{f(n)}=1$.




The only solution I found is $199$, can someone verify it please?










share|cite|improve this question









New contributor




3684 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.




















  • in the definition of $f$, are you concatenating the three results? Can you give an example of a pair $(n,f(n))$?
    – mathworker21
    yesterday










  • So $f(199) = 19, 9918, 81$?
    – steven gregory
    yesterday






  • 1




    @mathworker21`@stevengregory For example if $n=625$, $f(n)=6+2+5+6*2+6*5+2*5+6*2*5$
    – 3684
    yesterday






  • 2




    to do this problem, write $n = 100a+10b+c$ and just write everything out and solve the equation you get
    – mathworker21
    yesterday






  • 1




    @mathworker21, I have tried that but I didn't get too far, can you try it if you have time? I also thought about factorising a+b+c+ab+ac+bc+abc as (a+1)(b+1)(c+1)-1 but still wasn't able to get far. For number theory Olympiad problems are there systematic methods or does it require a different method every time.
    – 3684
    yesterday















up vote
3
down vote

favorite
1












This is my first time posting so do correct me if I am doing anything wrong.



Please help me with this math problem from the British Maths Olympiad (1994 British Maths Olympiad1 Q1 Number Theory).




Starting with any three digit number $n$ (such as $n = 625$) we obtain a new number $f(n)$ which is equal to the sum of the three digits of $n$, their three products in pairs, and the product of all three digits.
Find all three digit numbers such that $frac{n}{f(n)}=1$.




The only solution I found is $199$, can someone verify it please?










share|cite|improve this question









New contributor




3684 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.




















  • in the definition of $f$, are you concatenating the three results? Can you give an example of a pair $(n,f(n))$?
    – mathworker21
    yesterday










  • So $f(199) = 19, 9918, 81$?
    – steven gregory
    yesterday






  • 1




    @mathworker21`@stevengregory For example if $n=625$, $f(n)=6+2+5+6*2+6*5+2*5+6*2*5$
    – 3684
    yesterday






  • 2




    to do this problem, write $n = 100a+10b+c$ and just write everything out and solve the equation you get
    – mathworker21
    yesterday






  • 1




    @mathworker21, I have tried that but I didn't get too far, can you try it if you have time? I also thought about factorising a+b+c+ab+ac+bc+abc as (a+1)(b+1)(c+1)-1 but still wasn't able to get far. For number theory Olympiad problems are there systematic methods or does it require a different method every time.
    – 3684
    yesterday













up vote
3
down vote

favorite
1









up vote
3
down vote

favorite
1






1





This is my first time posting so do correct me if I am doing anything wrong.



Please help me with this math problem from the British Maths Olympiad (1994 British Maths Olympiad1 Q1 Number Theory).




Starting with any three digit number $n$ (such as $n = 625$) we obtain a new number $f(n)$ which is equal to the sum of the three digits of $n$, their three products in pairs, and the product of all three digits.
Find all three digit numbers such that $frac{n}{f(n)}=1$.




The only solution I found is $199$, can someone verify it please?










share|cite|improve this question









New contributor




3684 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.











This is my first time posting so do correct me if I am doing anything wrong.



Please help me with this math problem from the British Maths Olympiad (1994 British Maths Olympiad1 Q1 Number Theory).




Starting with any three digit number $n$ (such as $n = 625$) we obtain a new number $f(n)$ which is equal to the sum of the three digits of $n$, their three products in pairs, and the product of all three digits.
Find all three digit numbers such that $frac{n}{f(n)}=1$.




The only solution I found is $199$, can someone verify it please?







elementary-number-theory contest-math






share|cite|improve this question









New contributor




3684 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.











share|cite|improve this question









New contributor




3684 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









share|cite|improve this question




share|cite|improve this question








edited yesterday









amWhy

191k27223437




191k27223437






New contributor




3684 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









asked yesterday









3684

184




184




New contributor




3684 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.





New contributor





3684 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.






3684 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.












  • in the definition of $f$, are you concatenating the three results? Can you give an example of a pair $(n,f(n))$?
    – mathworker21
    yesterday










  • So $f(199) = 19, 9918, 81$?
    – steven gregory
    yesterday






  • 1




    @mathworker21`@stevengregory For example if $n=625$, $f(n)=6+2+5+6*2+6*5+2*5+6*2*5$
    – 3684
    yesterday






  • 2




    to do this problem, write $n = 100a+10b+c$ and just write everything out and solve the equation you get
    – mathworker21
    yesterday






  • 1




    @mathworker21, I have tried that but I didn't get too far, can you try it if you have time? I also thought about factorising a+b+c+ab+ac+bc+abc as (a+1)(b+1)(c+1)-1 but still wasn't able to get far. For number theory Olympiad problems are there systematic methods or does it require a different method every time.
    – 3684
    yesterday


















  • in the definition of $f$, are you concatenating the three results? Can you give an example of a pair $(n,f(n))$?
    – mathworker21
    yesterday










  • So $f(199) = 19, 9918, 81$?
    – steven gregory
    yesterday






  • 1




    @mathworker21`@stevengregory For example if $n=625$, $f(n)=6+2+5+6*2+6*5+2*5+6*2*5$
    – 3684
    yesterday






  • 2




    to do this problem, write $n = 100a+10b+c$ and just write everything out and solve the equation you get
    – mathworker21
    yesterday






  • 1




    @mathworker21, I have tried that but I didn't get too far, can you try it if you have time? I also thought about factorising a+b+c+ab+ac+bc+abc as (a+1)(b+1)(c+1)-1 but still wasn't able to get far. For number theory Olympiad problems are there systematic methods or does it require a different method every time.
    – 3684
    yesterday
















in the definition of $f$, are you concatenating the three results? Can you give an example of a pair $(n,f(n))$?
– mathworker21
yesterday




in the definition of $f$, are you concatenating the three results? Can you give an example of a pair $(n,f(n))$?
– mathworker21
yesterday












So $f(199) = 19, 9918, 81$?
– steven gregory
yesterday




So $f(199) = 19, 9918, 81$?
– steven gregory
yesterday




1




1




@mathworker21`@stevengregory For example if $n=625$, $f(n)=6+2+5+6*2+6*5+2*5+6*2*5$
– 3684
yesterday




@mathworker21`@stevengregory For example if $n=625$, $f(n)=6+2+5+6*2+6*5+2*5+6*2*5$
– 3684
yesterday




2




2




to do this problem, write $n = 100a+10b+c$ and just write everything out and solve the equation you get
– mathworker21
yesterday




to do this problem, write $n = 100a+10b+c$ and just write everything out and solve the equation you get
– mathworker21
yesterday




1




1




@mathworker21, I have tried that but I didn't get too far, can you try it if you have time? I also thought about factorising a+b+c+ab+ac+bc+abc as (a+1)(b+1)(c+1)-1 but still wasn't able to get far. For number theory Olympiad problems are there systematic methods or does it require a different method every time.
– 3684
yesterday




@mathworker21, I have tried that but I didn't get too far, can you try it if you have time? I also thought about factorising a+b+c+ab+ac+bc+abc as (a+1)(b+1)(c+1)-1 but still wasn't able to get far. For number theory Olympiad problems are there systematic methods or does it require a different method every time.
– 3684
yesterday










2 Answers
2






active

oldest

votes

















up vote
9
down vote



accepted










Let $n=100a+10b+c,$ where $a> 0$ and $b,cgeq 0$. We are trying to solve $$100a+10b+c=a+b+c+ab+ac+bc+abc \ implies 99a+9b=abc+ab+ac+bc \ implies a(99-b-c-bc)=b(c-9) \$$$c-9leq 0$, but $b+c+bcleq 99$. So the above equation holds iff $b=c=9$, which means $a$ can take any value.






share|cite|improve this answer





















  • May I ask how you got to the solution so quick, do you just see the solution?
    – 3684
    yesterday










  • @3684 this problem is fairly 'routine'. Plus, I might've seen this before/its associated solution, but I wouldn't remember if I did
    – user574848
    yesterday










  • How many main 'routine' methods to solve number theory problems would you say there are? At higher levels do you think each question requires some different insight.
    – 3684
    yesterday


















up vote
8
down vote













Here's part $(b)$ because I'm assuming you don't need help with part $(a)$:





We want to compute all possible integers $n$ such that $frac{n}{f(n)} = 1$. Since we know that, by assumption, $n$ is a three-digit number, we can write



$$n = 100a + 10b + c,$$



where $a, b, c$ are integers. If this is the case, in terms of our newly defined variables $a$, $b$, and $c$, we can express $f(n)$ as follows:



$$f(n) = abc + ab + bc + ac + a + b + c.$$



Now, in order to have $frac{n}{f(n)} = 1,$ we must have $n = f(n)$. This happens when



$$99a + 9b = abc + ab + bc + ac$$



$$Longleftrightarrow (9-c)b = a(bc + b + c - 99) $$



Also, we must have $b, c leq 9,$ which implies $bc + b + c - 99 leq 0$. However, since $a neq 0$ (if $a = 0$, we would be able to form a two or one-digit number instead of a three-digit one!), we conclude $b = c = 9$. Therefore, our solution set is given by



$$boxed{{199, 299, 399, 499, 599, 699, 799, 899, 999}}$$






share|cite|improve this answer








New contributor




Ekesh is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.


















  • Thank you for your answer, sorry I could only accept one answer. May I ask how you see the solution so quick?
    – 3684
    yesterday










  • It's okay. Hopefully my answer still helps you. I also used to participate in math competitions. I think that the best way to get faster is to just practice by doing many problems.
    – Ekesh
    yesterday













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',
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
});


}
});






3684 is a new contributor. Be nice, and check out our Code of Conduct.










 

draft saved


draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3004566%2fgiven-a-three-digit-number-n-let-fn-be-the-sum-of-digits-of-n-their-pr%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























2 Answers
2






active

oldest

votes








2 Answers
2






active

oldest

votes









active

oldest

votes






active

oldest

votes








up vote
9
down vote



accepted










Let $n=100a+10b+c,$ where $a> 0$ and $b,cgeq 0$. We are trying to solve $$100a+10b+c=a+b+c+ab+ac+bc+abc \ implies 99a+9b=abc+ab+ac+bc \ implies a(99-b-c-bc)=b(c-9) \$$$c-9leq 0$, but $b+c+bcleq 99$. So the above equation holds iff $b=c=9$, which means $a$ can take any value.






share|cite|improve this answer





















  • May I ask how you got to the solution so quick, do you just see the solution?
    – 3684
    yesterday










  • @3684 this problem is fairly 'routine'. Plus, I might've seen this before/its associated solution, but I wouldn't remember if I did
    – user574848
    yesterday










  • How many main 'routine' methods to solve number theory problems would you say there are? At higher levels do you think each question requires some different insight.
    – 3684
    yesterday















up vote
9
down vote



accepted










Let $n=100a+10b+c,$ where $a> 0$ and $b,cgeq 0$. We are trying to solve $$100a+10b+c=a+b+c+ab+ac+bc+abc \ implies 99a+9b=abc+ab+ac+bc \ implies a(99-b-c-bc)=b(c-9) \$$$c-9leq 0$, but $b+c+bcleq 99$. So the above equation holds iff $b=c=9$, which means $a$ can take any value.






share|cite|improve this answer





















  • May I ask how you got to the solution so quick, do you just see the solution?
    – 3684
    yesterday










  • @3684 this problem is fairly 'routine'. Plus, I might've seen this before/its associated solution, but I wouldn't remember if I did
    – user574848
    yesterday










  • How many main 'routine' methods to solve number theory problems would you say there are? At higher levels do you think each question requires some different insight.
    – 3684
    yesterday













up vote
9
down vote



accepted







up vote
9
down vote



accepted






Let $n=100a+10b+c,$ where $a> 0$ and $b,cgeq 0$. We are trying to solve $$100a+10b+c=a+b+c+ab+ac+bc+abc \ implies 99a+9b=abc+ab+ac+bc \ implies a(99-b-c-bc)=b(c-9) \$$$c-9leq 0$, but $b+c+bcleq 99$. So the above equation holds iff $b=c=9$, which means $a$ can take any value.






share|cite|improve this answer












Let $n=100a+10b+c,$ where $a> 0$ and $b,cgeq 0$. We are trying to solve $$100a+10b+c=a+b+c+ab+ac+bc+abc \ implies 99a+9b=abc+ab+ac+bc \ implies a(99-b-c-bc)=b(c-9) \$$$c-9leq 0$, but $b+c+bcleq 99$. So the above equation holds iff $b=c=9$, which means $a$ can take any value.







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered yesterday









user574848

16210




16210












  • May I ask how you got to the solution so quick, do you just see the solution?
    – 3684
    yesterday










  • @3684 this problem is fairly 'routine'. Plus, I might've seen this before/its associated solution, but I wouldn't remember if I did
    – user574848
    yesterday










  • How many main 'routine' methods to solve number theory problems would you say there are? At higher levels do you think each question requires some different insight.
    – 3684
    yesterday


















  • May I ask how you got to the solution so quick, do you just see the solution?
    – 3684
    yesterday










  • @3684 this problem is fairly 'routine'. Plus, I might've seen this before/its associated solution, but I wouldn't remember if I did
    – user574848
    yesterday










  • How many main 'routine' methods to solve number theory problems would you say there are? At higher levels do you think each question requires some different insight.
    – 3684
    yesterday
















May I ask how you got to the solution so quick, do you just see the solution?
– 3684
yesterday




May I ask how you got to the solution so quick, do you just see the solution?
– 3684
yesterday












@3684 this problem is fairly 'routine'. Plus, I might've seen this before/its associated solution, but I wouldn't remember if I did
– user574848
yesterday




@3684 this problem is fairly 'routine'. Plus, I might've seen this before/its associated solution, but I wouldn't remember if I did
– user574848
yesterday












How many main 'routine' methods to solve number theory problems would you say there are? At higher levels do you think each question requires some different insight.
– 3684
yesterday




How many main 'routine' methods to solve number theory problems would you say there are? At higher levels do you think each question requires some different insight.
– 3684
yesterday










up vote
8
down vote













Here's part $(b)$ because I'm assuming you don't need help with part $(a)$:





We want to compute all possible integers $n$ such that $frac{n}{f(n)} = 1$. Since we know that, by assumption, $n$ is a three-digit number, we can write



$$n = 100a + 10b + c,$$



where $a, b, c$ are integers. If this is the case, in terms of our newly defined variables $a$, $b$, and $c$, we can express $f(n)$ as follows:



$$f(n) = abc + ab + bc + ac + a + b + c.$$



Now, in order to have $frac{n}{f(n)} = 1,$ we must have $n = f(n)$. This happens when



$$99a + 9b = abc + ab + bc + ac$$



$$Longleftrightarrow (9-c)b = a(bc + b + c - 99) $$



Also, we must have $b, c leq 9,$ which implies $bc + b + c - 99 leq 0$. However, since $a neq 0$ (if $a = 0$, we would be able to form a two or one-digit number instead of a three-digit one!), we conclude $b = c = 9$. Therefore, our solution set is given by



$$boxed{{199, 299, 399, 499, 599, 699, 799, 899, 999}}$$






share|cite|improve this answer








New contributor




Ekesh is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.


















  • Thank you for your answer, sorry I could only accept one answer. May I ask how you see the solution so quick?
    – 3684
    yesterday










  • It's okay. Hopefully my answer still helps you. I also used to participate in math competitions. I think that the best way to get faster is to just practice by doing many problems.
    – Ekesh
    yesterday

















up vote
8
down vote













Here's part $(b)$ because I'm assuming you don't need help with part $(a)$:





We want to compute all possible integers $n$ such that $frac{n}{f(n)} = 1$. Since we know that, by assumption, $n$ is a three-digit number, we can write



$$n = 100a + 10b + c,$$



where $a, b, c$ are integers. If this is the case, in terms of our newly defined variables $a$, $b$, and $c$, we can express $f(n)$ as follows:



$$f(n) = abc + ab + bc + ac + a + b + c.$$



Now, in order to have $frac{n}{f(n)} = 1,$ we must have $n = f(n)$. This happens when



$$99a + 9b = abc + ab + bc + ac$$



$$Longleftrightarrow (9-c)b = a(bc + b + c - 99) $$



Also, we must have $b, c leq 9,$ which implies $bc + b + c - 99 leq 0$. However, since $a neq 0$ (if $a = 0$, we would be able to form a two or one-digit number instead of a three-digit one!), we conclude $b = c = 9$. Therefore, our solution set is given by



$$boxed{{199, 299, 399, 499, 599, 699, 799, 899, 999}}$$






share|cite|improve this answer








New contributor




Ekesh is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.


















  • Thank you for your answer, sorry I could only accept one answer. May I ask how you see the solution so quick?
    – 3684
    yesterday










  • It's okay. Hopefully my answer still helps you. I also used to participate in math competitions. I think that the best way to get faster is to just practice by doing many problems.
    – Ekesh
    yesterday















up vote
8
down vote










up vote
8
down vote









Here's part $(b)$ because I'm assuming you don't need help with part $(a)$:





We want to compute all possible integers $n$ such that $frac{n}{f(n)} = 1$. Since we know that, by assumption, $n$ is a three-digit number, we can write



$$n = 100a + 10b + c,$$



where $a, b, c$ are integers. If this is the case, in terms of our newly defined variables $a$, $b$, and $c$, we can express $f(n)$ as follows:



$$f(n) = abc + ab + bc + ac + a + b + c.$$



Now, in order to have $frac{n}{f(n)} = 1,$ we must have $n = f(n)$. This happens when



$$99a + 9b = abc + ab + bc + ac$$



$$Longleftrightarrow (9-c)b = a(bc + b + c - 99) $$



Also, we must have $b, c leq 9,$ which implies $bc + b + c - 99 leq 0$. However, since $a neq 0$ (if $a = 0$, we would be able to form a two or one-digit number instead of a three-digit one!), we conclude $b = c = 9$. Therefore, our solution set is given by



$$boxed{{199, 299, 399, 499, 599, 699, 799, 899, 999}}$$






share|cite|improve this answer








New contributor




Ekesh is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









Here's part $(b)$ because I'm assuming you don't need help with part $(a)$:





We want to compute all possible integers $n$ such that $frac{n}{f(n)} = 1$. Since we know that, by assumption, $n$ is a three-digit number, we can write



$$n = 100a + 10b + c,$$



where $a, b, c$ are integers. If this is the case, in terms of our newly defined variables $a$, $b$, and $c$, we can express $f(n)$ as follows:



$$f(n) = abc + ab + bc + ac + a + b + c.$$



Now, in order to have $frac{n}{f(n)} = 1,$ we must have $n = f(n)$. This happens when



$$99a + 9b = abc + ab + bc + ac$$



$$Longleftrightarrow (9-c)b = a(bc + b + c - 99) $$



Also, we must have $b, c leq 9,$ which implies $bc + b + c - 99 leq 0$. However, since $a neq 0$ (if $a = 0$, we would be able to form a two or one-digit number instead of a three-digit one!), we conclude $b = c = 9$. Therefore, our solution set is given by



$$boxed{{199, 299, 399, 499, 599, 699, 799, 899, 999}}$$







share|cite|improve this answer








New contributor




Ekesh is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









share|cite|improve this answer



share|cite|improve this answer






New contributor




Ekesh is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









answered yesterday









Ekesh

3514




3514




New contributor




Ekesh is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.





New contributor





Ekesh is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.






Ekesh is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.












  • Thank you for your answer, sorry I could only accept one answer. May I ask how you see the solution so quick?
    – 3684
    yesterday










  • It's okay. Hopefully my answer still helps you. I also used to participate in math competitions. I think that the best way to get faster is to just practice by doing many problems.
    – Ekesh
    yesterday




















  • Thank you for your answer, sorry I could only accept one answer. May I ask how you see the solution so quick?
    – 3684
    yesterday










  • It's okay. Hopefully my answer still helps you. I also used to participate in math competitions. I think that the best way to get faster is to just practice by doing many problems.
    – Ekesh
    yesterday


















Thank you for your answer, sorry I could only accept one answer. May I ask how you see the solution so quick?
– 3684
yesterday




Thank you for your answer, sorry I could only accept one answer. May I ask how you see the solution so quick?
– 3684
yesterday












It's okay. Hopefully my answer still helps you. I also used to participate in math competitions. I think that the best way to get faster is to just practice by doing many problems.
– Ekesh
yesterday






It's okay. Hopefully my answer still helps you. I also used to participate in math competitions. I think that the best way to get faster is to just practice by doing many problems.
– Ekesh
yesterday












3684 is a new contributor. Be nice, and check out our Code of Conduct.










 

draft saved


draft discarded


















3684 is a new contributor. Be nice, and check out our Code of Conduct.













3684 is a new contributor. Be nice, and check out our Code of Conduct.












3684 is a new contributor. Be nice, and check out our Code of Conduct.















 


draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3004566%2fgiven-a-three-digit-number-n-let-fn-be-the-sum-of-digits-of-n-their-pr%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

Accessing regular linux commands in Huawei's Dopra Linux

Can't connect RFCOMM socket: Host is down

Kernel panic - not syncing: Fatal Exception in Interrupt