Find all three digit numbers which are divisible by groups of its digits [closed]
$begingroup$
How can I find all three-digit numbers which:
- Do not contain a $0$ digit
- Have different digits
- Are divisible by below described groups of its own digits
The number passing first two conditions should be divisible by two-digit group of its own digits, which are made by omitting one of the number's digits.
For example:
number = $132$
It has only non-zero digits
It has different digits
And it should be divisible by $13$, $12$, and $32$. (omitting one digit)
Thanks a lot in advance for helping me finding these!
combinatorics divisibility decimal-expansion
$endgroup$
closed as off-topic by Robert Z, José Carlos Santos, Cesareo, Servaes, Brian Borchers Jan 20 at 23:02
This question appears to be off-topic. The users who voted to close gave this specific reason:
- "This question is missing context or other details: Please provide additional context, which ideally explains why the question is relevant to you and our community. Some forms of context include: background and motivation, relevant definitions, source, possible strategies, your current progress, why the question is interesting or important, etc." – Robert Z, José Carlos Santos, Cesareo, Servaes, Brian Borchers
If this question can be reworded to fit the rules in the help center, please edit the question.
add a comment |
$begingroup$
How can I find all three-digit numbers which:
- Do not contain a $0$ digit
- Have different digits
- Are divisible by below described groups of its own digits
The number passing first two conditions should be divisible by two-digit group of its own digits, which are made by omitting one of the number's digits.
For example:
number = $132$
It has only non-zero digits
It has different digits
And it should be divisible by $13$, $12$, and $32$. (omitting one digit)
Thanks a lot in advance for helping me finding these!
combinatorics divisibility decimal-expansion
$endgroup$
closed as off-topic by Robert Z, José Carlos Santos, Cesareo, Servaes, Brian Borchers Jan 20 at 23:02
This question appears to be off-topic. The users who voted to close gave this specific reason:
- "This question is missing context or other details: Please provide additional context, which ideally explains why the question is relevant to you and our community. Some forms of context include: background and motivation, relevant definitions, source, possible strategies, your current progress, why the question is interesting or important, etc." – Robert Z, José Carlos Santos, Cesareo, Servaes, Brian Borchers
If this question can be reworded to fit the rules in the help center, please edit the question.
2
$begingroup$
What have you tried?
$endgroup$
– Robert Z
Jan 20 at 9:24
add a comment |
$begingroup$
How can I find all three-digit numbers which:
- Do not contain a $0$ digit
- Have different digits
- Are divisible by below described groups of its own digits
The number passing first two conditions should be divisible by two-digit group of its own digits, which are made by omitting one of the number's digits.
For example:
number = $132$
It has only non-zero digits
It has different digits
And it should be divisible by $13$, $12$, and $32$. (omitting one digit)
Thanks a lot in advance for helping me finding these!
combinatorics divisibility decimal-expansion
$endgroup$
How can I find all three-digit numbers which:
- Do not contain a $0$ digit
- Have different digits
- Are divisible by below described groups of its own digits
The number passing first two conditions should be divisible by two-digit group of its own digits, which are made by omitting one of the number's digits.
For example:
number = $132$
It has only non-zero digits
It has different digits
And it should be divisible by $13$, $12$, and $32$. (omitting one digit)
Thanks a lot in advance for helping me finding these!
combinatorics divisibility decimal-expansion
combinatorics divisibility decimal-expansion
asked Jan 20 at 9:21
Xxx DddXxx Ddd
354
354
closed as off-topic by Robert Z, José Carlos Santos, Cesareo, Servaes, Brian Borchers Jan 20 at 23:02
This question appears to be off-topic. The users who voted to close gave this specific reason:
- "This question is missing context or other details: Please provide additional context, which ideally explains why the question is relevant to you and our community. Some forms of context include: background and motivation, relevant definitions, source, possible strategies, your current progress, why the question is interesting or important, etc." – Robert Z, José Carlos Santos, Cesareo, Servaes, Brian Borchers
If this question can be reworded to fit the rules in the help center, please edit the question.
closed as off-topic by Robert Z, José Carlos Santos, Cesareo, Servaes, Brian Borchers Jan 20 at 23:02
This question appears to be off-topic. The users who voted to close gave this specific reason:
- "This question is missing context or other details: Please provide additional context, which ideally explains why the question is relevant to you and our community. Some forms of context include: background and motivation, relevant definitions, source, possible strategies, your current progress, why the question is interesting or important, etc." – Robert Z, José Carlos Santos, Cesareo, Servaes, Brian Borchers
If this question can be reworded to fit the rules in the help center, please edit the question.
2
$begingroup$
What have you tried?
$endgroup$
– Robert Z
Jan 20 at 9:24
add a comment |
2
$begingroup$
What have you tried?
$endgroup$
– Robert Z
Jan 20 at 9:24
2
2
$begingroup$
What have you tried?
$endgroup$
– Robert Z
Jan 20 at 9:24
$begingroup$
What have you tried?
$endgroup$
– Robert Z
Jan 20 at 9:24
add a comment |
3 Answers
3
active
oldest
votes
$begingroup$
It's actually never possible to find such numbers since for a three digit number $[abc]$
$$10a+b mid 100a+10b+ciff frac{100a+10b+c}{10a+b}in mathbb Z$$
However
$$frac{100a+10b+c}{10a+b}=frac{10·(10a+b)+c}{10a+b}=10+frac{c}{10a+b}notin mathbb Z$$
Which is the desired contradiction since
$$a,b,cin {ninmathbb N: 1≤n≤9}$$ Therefore $$c<10a+b$$and hence $$10a+bnmid c$$
$endgroup$
add a comment |
$begingroup$
A number $$abc$$ formed by the non-zero digits $a,b,c$ can never be divisible by $$ab$$ formed by $a$ and $b$ because if we divide by this number, the residue is $c$ which is non-zero and smaller than the number $ab$.
$endgroup$
add a comment |
$begingroup$
Any three digit number $100a + 10b + c$, can be expressed as $10(10a + b) + c$
$$Rightarrow 10(10a + b) + c mod 10a+b = c, c ne 0$$
This contradicts the last condition
- Are divisible by below-described groups of its own digits
$endgroup$
add a comment |
3 Answers
3
active
oldest
votes
3 Answers
3
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
It's actually never possible to find such numbers since for a three digit number $[abc]$
$$10a+b mid 100a+10b+ciff frac{100a+10b+c}{10a+b}in mathbb Z$$
However
$$frac{100a+10b+c}{10a+b}=frac{10·(10a+b)+c}{10a+b}=10+frac{c}{10a+b}notin mathbb Z$$
Which is the desired contradiction since
$$a,b,cin {ninmathbb N: 1≤n≤9}$$ Therefore $$c<10a+b$$and hence $$10a+bnmid c$$
$endgroup$
add a comment |
$begingroup$
It's actually never possible to find such numbers since for a three digit number $[abc]$
$$10a+b mid 100a+10b+ciff frac{100a+10b+c}{10a+b}in mathbb Z$$
However
$$frac{100a+10b+c}{10a+b}=frac{10·(10a+b)+c}{10a+b}=10+frac{c}{10a+b}notin mathbb Z$$
Which is the desired contradiction since
$$a,b,cin {ninmathbb N: 1≤n≤9}$$ Therefore $$c<10a+b$$and hence $$10a+bnmid c$$
$endgroup$
add a comment |
$begingroup$
It's actually never possible to find such numbers since for a three digit number $[abc]$
$$10a+b mid 100a+10b+ciff frac{100a+10b+c}{10a+b}in mathbb Z$$
However
$$frac{100a+10b+c}{10a+b}=frac{10·(10a+b)+c}{10a+b}=10+frac{c}{10a+b}notin mathbb Z$$
Which is the desired contradiction since
$$a,b,cin {ninmathbb N: 1≤n≤9}$$ Therefore $$c<10a+b$$and hence $$10a+bnmid c$$
$endgroup$
It's actually never possible to find such numbers since for a three digit number $[abc]$
$$10a+b mid 100a+10b+ciff frac{100a+10b+c}{10a+b}in mathbb Z$$
However
$$frac{100a+10b+c}{10a+b}=frac{10·(10a+b)+c}{10a+b}=10+frac{c}{10a+b}notin mathbb Z$$
Which is the desired contradiction since
$$a,b,cin {ninmathbb N: 1≤n≤9}$$ Therefore $$c<10a+b$$and hence $$10a+bnmid c$$
answered Jan 20 at 9:35
Dr. MathvaDr. Mathva
1,668321
1,668321
add a comment |
add a comment |
$begingroup$
A number $$abc$$ formed by the non-zero digits $a,b,c$ can never be divisible by $$ab$$ formed by $a$ and $b$ because if we divide by this number, the residue is $c$ which is non-zero and smaller than the number $ab$.
$endgroup$
add a comment |
$begingroup$
A number $$abc$$ formed by the non-zero digits $a,b,c$ can never be divisible by $$ab$$ formed by $a$ and $b$ because if we divide by this number, the residue is $c$ which is non-zero and smaller than the number $ab$.
$endgroup$
add a comment |
$begingroup$
A number $$abc$$ formed by the non-zero digits $a,b,c$ can never be divisible by $$ab$$ formed by $a$ and $b$ because if we divide by this number, the residue is $c$ which is non-zero and smaller than the number $ab$.
$endgroup$
A number $$abc$$ formed by the non-zero digits $a,b,c$ can never be divisible by $$ab$$ formed by $a$ and $b$ because if we divide by this number, the residue is $c$ which is non-zero and smaller than the number $ab$.
answered Jan 20 at 9:31
PeterPeter
47.6k1039131
47.6k1039131
add a comment |
add a comment |
$begingroup$
Any three digit number $100a + 10b + c$, can be expressed as $10(10a + b) + c$
$$Rightarrow 10(10a + b) + c mod 10a+b = c, c ne 0$$
This contradicts the last condition
- Are divisible by below-described groups of its own digits
$endgroup$
add a comment |
$begingroup$
Any three digit number $100a + 10b + c$, can be expressed as $10(10a + b) + c$
$$Rightarrow 10(10a + b) + c mod 10a+b = c, c ne 0$$
This contradicts the last condition
- Are divisible by below-described groups of its own digits
$endgroup$
add a comment |
$begingroup$
Any three digit number $100a + 10b + c$, can be expressed as $10(10a + b) + c$
$$Rightarrow 10(10a + b) + c mod 10a+b = c, c ne 0$$
This contradicts the last condition
- Are divisible by below-described groups of its own digits
$endgroup$
Any three digit number $100a + 10b + c$, can be expressed as $10(10a + b) + c$
$$Rightarrow 10(10a + b) + c mod 10a+b = c, c ne 0$$
This contradicts the last condition
- Are divisible by below-described groups of its own digits
answered Jan 20 at 15:23
AbhijitAbhijit
2,377719
2,377719
add a comment |
add a comment |
2
$begingroup$
What have you tried?
$endgroup$
– Robert Z
Jan 20 at 9:24