Elementary number theory in sets
Clash Royale CLAN TAG#URR8PPP
up vote
6
down vote
favorite
I'm back again
So there's another problem that I can't get to prove
If we take 21 numbers randomly from $1, 2, 3, ..., 40$ then between those $21$ numbers we will be able to find two numbers, of which the smaller one will divide the bigger one
I've been reading james hein "discrete structures, logic and computability" but still can't get to think logically myself.
I would be very grateful if I could get some directions/tips/hints or anything, thanks in advance
combinatorics elementary-number-theory discrete-mathematics divisibility
add a comment |Â
up vote
6
down vote
favorite
I'm back again
So there's another problem that I can't get to prove
If we take 21 numbers randomly from $1, 2, 3, ..., 40$ then between those $21$ numbers we will be able to find two numbers, of which the smaller one will divide the bigger one
I've been reading james hein "discrete structures, logic and computability" but still can't get to think logically myself.
I would be very grateful if I could get some directions/tips/hints or anything, thanks in advance
combinatorics elementary-number-theory discrete-mathematics divisibility
add a comment |Â
up vote
6
down vote
favorite
up vote
6
down vote
favorite
I'm back again
So there's another problem that I can't get to prove
If we take 21 numbers randomly from $1, 2, 3, ..., 40$ then between those $21$ numbers we will be able to find two numbers, of which the smaller one will divide the bigger one
I've been reading james hein "discrete structures, logic and computability" but still can't get to think logically myself.
I would be very grateful if I could get some directions/tips/hints or anything, thanks in advance
combinatorics elementary-number-theory discrete-mathematics divisibility
I'm back again
So there's another problem that I can't get to prove
If we take 21 numbers randomly from $1, 2, 3, ..., 40$ then between those $21$ numbers we will be able to find two numbers, of which the smaller one will divide the bigger one
I've been reading james hein "discrete structures, logic and computability" but still can't get to think logically myself.
I would be very grateful if I could get some directions/tips/hints or anything, thanks in advance
combinatorics elementary-number-theory discrete-mathematics divisibility
combinatorics elementary-number-theory discrete-mathematics divisibility
edited 3 hours ago
greedoid
29.6k93879
29.6k93879
asked 3 hours ago
Nojus Kudaba
663
663
add a comment |Â
add a comment |Â
1 Answer
1
active
oldest
votes
up vote
5
down vote
accepted
Make a following sets:
$$ A= 1,2,4,8,16,32$$
$$ B= 3,6,12,24$$
$$ C = 5,10,20,40$$
$$ D = 7,14,28$$
$$ E = 9,18,36$$
$$F = 11,22$$
$$G = 13,26$$
$$H= 15,30$$
$$I = 17,34$$
$$J = 19,38$$
$$K = 21,23,25,27,29,31,33,35,37,39$$
Suppose the statement is not true. Then we take from each set A,B,...,J at most one element and if we take all elements from K we have a total of 20 elements. A contradiction.
add a comment |Â
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
5
down vote
accepted
Make a following sets:
$$ A= 1,2,4,8,16,32$$
$$ B= 3,6,12,24$$
$$ C = 5,10,20,40$$
$$ D = 7,14,28$$
$$ E = 9,18,36$$
$$F = 11,22$$
$$G = 13,26$$
$$H= 15,30$$
$$I = 17,34$$
$$J = 19,38$$
$$K = 21,23,25,27,29,31,33,35,37,39$$
Suppose the statement is not true. Then we take from each set A,B,...,J at most one element and if we take all elements from K we have a total of 20 elements. A contradiction.
add a comment |Â
up vote
5
down vote
accepted
Make a following sets:
$$ A= 1,2,4,8,16,32$$
$$ B= 3,6,12,24$$
$$ C = 5,10,20,40$$
$$ D = 7,14,28$$
$$ E = 9,18,36$$
$$F = 11,22$$
$$G = 13,26$$
$$H= 15,30$$
$$I = 17,34$$
$$J = 19,38$$
$$K = 21,23,25,27,29,31,33,35,37,39$$
Suppose the statement is not true. Then we take from each set A,B,...,J at most one element and if we take all elements from K we have a total of 20 elements. A contradiction.
add a comment |Â
up vote
5
down vote
accepted
up vote
5
down vote
accepted
Make a following sets:
$$ A= 1,2,4,8,16,32$$
$$ B= 3,6,12,24$$
$$ C = 5,10,20,40$$
$$ D = 7,14,28$$
$$ E = 9,18,36$$
$$F = 11,22$$
$$G = 13,26$$
$$H= 15,30$$
$$I = 17,34$$
$$J = 19,38$$
$$K = 21,23,25,27,29,31,33,35,37,39$$
Suppose the statement is not true. Then we take from each set A,B,...,J at most one element and if we take all elements from K we have a total of 20 elements. A contradiction.
Make a following sets:
$$ A= 1,2,4,8,16,32$$
$$ B= 3,6,12,24$$
$$ C = 5,10,20,40$$
$$ D = 7,14,28$$
$$ E = 9,18,36$$
$$F = 11,22$$
$$G = 13,26$$
$$H= 15,30$$
$$I = 17,34$$
$$J = 19,38$$
$$K = 21,23,25,27,29,31,33,35,37,39$$
Suppose the statement is not true. Then we take from each set A,B,...,J at most one element and if we take all elements from K we have a total of 20 elements. A contradiction.
edited 3 hours ago
answered 3 hours ago
greedoid
29.6k93879
29.6k93879
add a comment |Â
add a comment |Â
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
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2933553%2felementary-number-theory-in-sets%23new-answer', 'question_page');
);
Post as a guest
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
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
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