NUMBER system and counting
Clash Royale CLAN TAG#URR8PPP
up vote
-1
down vote
favorite
Let $S =1,2,3,...,20$ be the set of all positive from $1$ to $20$ suppose that $N$ is the smallest positive integer such that exactly eighteen numbers from $S$ are factors of $N$ and the only two numbers from $S$ that are not factors of $N$ are consecutive integers. Find the sum of digits of $N$.
We first find out which two consecutive numbers from $S$ are
not factors of $N$. Clearly $1$ is the factor of $N$.
If $k$ is not factor of $N$ then $2k$ will also be not he factor of $N$.
How will I solve further please help.
Thanks
number-theory number-systems
add a comment |Â
up vote
-1
down vote
favorite
Let $S =1,2,3,...,20$ be the set of all positive from $1$ to $20$ suppose that $N$ is the smallest positive integer such that exactly eighteen numbers from $S$ are factors of $N$ and the only two numbers from $S$ that are not factors of $N$ are consecutive integers. Find the sum of digits of $N$.
We first find out which two consecutive numbers from $S$ are
not factors of $N$. Clearly $1$ is the factor of $N$.
If $k$ is not factor of $N$ then $2k$ will also be not he factor of $N$.
How will I solve further please help.
Thanks
number-theory number-systems
add a comment |Â
up vote
-1
down vote
favorite
up vote
-1
down vote
favorite
Let $S =1,2,3,...,20$ be the set of all positive from $1$ to $20$ suppose that $N$ is the smallest positive integer such that exactly eighteen numbers from $S$ are factors of $N$ and the only two numbers from $S$ that are not factors of $N$ are consecutive integers. Find the sum of digits of $N$.
We first find out which two consecutive numbers from $S$ are
not factors of $N$. Clearly $1$ is the factor of $N$.
If $k$ is not factor of $N$ then $2k$ will also be not he factor of $N$.
How will I solve further please help.
Thanks
number-theory number-systems
Let $S =1,2,3,...,20$ be the set of all positive from $1$ to $20$ suppose that $N$ is the smallest positive integer such that exactly eighteen numbers from $S$ are factors of $N$ and the only two numbers from $S$ that are not factors of $N$ are consecutive integers. Find the sum of digits of $N$.
We first find out which two consecutive numbers from $S$ are
not factors of $N$. Clearly $1$ is the factor of $N$.
If $k$ is not factor of $N$ then $2k$ will also be not he factor of $N$.
How will I solve further please help.
Thanks
number-theory number-systems
edited Aug 18 at 5:05
apanpapan3
1231211
1231211
asked Aug 18 at 4:59
Mamta Gupta
63
63
add a comment |Â
add a comment |Â
1 Answer
1
active
oldest
votes
up vote
1
down vote
Hint: start down the possible pairs of nonfactors. It can't be $19,20$ because then we know $4$ and $5$ are both factors, so $20$ must be. Now try $18,19$, which fails (why?). Keep going.
Yes I got it then 16 and 17 are not the factors of N
â Mamta Gupta
Aug 18 at 5:10
Correct. Can you find the prime decomposition of $N$? Where are you stuck?
â Ross Millikan
Aug 18 at 5:19
Yes 2^3Ã3^2Ã5Ã7Ã11Ã13Ã19=6846840
â Mamta Gupta
Aug 18 at 5:31
Is it correct....
â Mamta Gupta
Aug 18 at 5:31
2
Yes, that is correct. Once you have $N$ you have the sum of digits. It is interesting to try to state the condition on the pair of missing numbers based on the maximum number in $S$.
â Ross Millikan
Aug 18 at 5:35
add a comment |Â
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
1
down vote
Hint: start down the possible pairs of nonfactors. It can't be $19,20$ because then we know $4$ and $5$ are both factors, so $20$ must be. Now try $18,19$, which fails (why?). Keep going.
Yes I got it then 16 and 17 are not the factors of N
â Mamta Gupta
Aug 18 at 5:10
Correct. Can you find the prime decomposition of $N$? Where are you stuck?
â Ross Millikan
Aug 18 at 5:19
Yes 2^3Ã3^2Ã5Ã7Ã11Ã13Ã19=6846840
â Mamta Gupta
Aug 18 at 5:31
Is it correct....
â Mamta Gupta
Aug 18 at 5:31
2
Yes, that is correct. Once you have $N$ you have the sum of digits. It is interesting to try to state the condition on the pair of missing numbers based on the maximum number in $S$.
â Ross Millikan
Aug 18 at 5:35
add a comment |Â
up vote
1
down vote
Hint: start down the possible pairs of nonfactors. It can't be $19,20$ because then we know $4$ and $5$ are both factors, so $20$ must be. Now try $18,19$, which fails (why?). Keep going.
Yes I got it then 16 and 17 are not the factors of N
â Mamta Gupta
Aug 18 at 5:10
Correct. Can you find the prime decomposition of $N$? Where are you stuck?
â Ross Millikan
Aug 18 at 5:19
Yes 2^3Ã3^2Ã5Ã7Ã11Ã13Ã19=6846840
â Mamta Gupta
Aug 18 at 5:31
Is it correct....
â Mamta Gupta
Aug 18 at 5:31
2
Yes, that is correct. Once you have $N$ you have the sum of digits. It is interesting to try to state the condition on the pair of missing numbers based on the maximum number in $S$.
â Ross Millikan
Aug 18 at 5:35
add a comment |Â
up vote
1
down vote
up vote
1
down vote
Hint: start down the possible pairs of nonfactors. It can't be $19,20$ because then we know $4$ and $5$ are both factors, so $20$ must be. Now try $18,19$, which fails (why?). Keep going.
Hint: start down the possible pairs of nonfactors. It can't be $19,20$ because then we know $4$ and $5$ are both factors, so $20$ must be. Now try $18,19$, which fails (why?). Keep going.
answered Aug 18 at 5:06
Ross Millikan
278k21187354
278k21187354
Yes I got it then 16 and 17 are not the factors of N
â Mamta Gupta
Aug 18 at 5:10
Correct. Can you find the prime decomposition of $N$? Where are you stuck?
â Ross Millikan
Aug 18 at 5:19
Yes 2^3Ã3^2Ã5Ã7Ã11Ã13Ã19=6846840
â Mamta Gupta
Aug 18 at 5:31
Is it correct....
â Mamta Gupta
Aug 18 at 5:31
2
Yes, that is correct. Once you have $N$ you have the sum of digits. It is interesting to try to state the condition on the pair of missing numbers based on the maximum number in $S$.
â Ross Millikan
Aug 18 at 5:35
add a comment |Â
Yes I got it then 16 and 17 are not the factors of N
â Mamta Gupta
Aug 18 at 5:10
Correct. Can you find the prime decomposition of $N$? Where are you stuck?
â Ross Millikan
Aug 18 at 5:19
Yes 2^3Ã3^2Ã5Ã7Ã11Ã13Ã19=6846840
â Mamta Gupta
Aug 18 at 5:31
Is it correct....
â Mamta Gupta
Aug 18 at 5:31
2
Yes, that is correct. Once you have $N$ you have the sum of digits. It is interesting to try to state the condition on the pair of missing numbers based on the maximum number in $S$.
â Ross Millikan
Aug 18 at 5:35
Yes I got it then 16 and 17 are not the factors of N
â Mamta Gupta
Aug 18 at 5:10
Yes I got it then 16 and 17 are not the factors of N
â Mamta Gupta
Aug 18 at 5:10
Correct. Can you find the prime decomposition of $N$? Where are you stuck?
â Ross Millikan
Aug 18 at 5:19
Correct. Can you find the prime decomposition of $N$? Where are you stuck?
â Ross Millikan
Aug 18 at 5:19
Yes 2^3Ã3^2Ã5Ã7Ã11Ã13Ã19=6846840
â Mamta Gupta
Aug 18 at 5:31
Yes 2^3Ã3^2Ã5Ã7Ã11Ã13Ã19=6846840
â Mamta Gupta
Aug 18 at 5:31
Is it correct....
â Mamta Gupta
Aug 18 at 5:31
Is it correct....
â Mamta Gupta
Aug 18 at 5:31
2
2
Yes, that is correct. Once you have $N$ you have the sum of digits. It is interesting to try to state the condition on the pair of missing numbers based on the maximum number in $S$.
â Ross Millikan
Aug 18 at 5:35
Yes, that is correct. Once you have $N$ you have the sum of digits. It is interesting to try to state the condition on the pair of missing numbers based on the maximum number in $S$.
â Ross Millikan
Aug 18 at 5:35
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%2f2886428%2fnumber-system-and-counting%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