divide a number in k parts such that GCD of the part is maximum
up vote
0
down vote
favorite
You have been given a number $N$. You have to divide it in exactly $k$ parts such that the gcd of the $k$ parts is maximal.
elementary-number-theory
edited Nov 17 at 16:19
klirk
2,232428
asked Nov 17 at 15:22
Tanu kumar
11
add a comment |
up vote
0
down vote
favorite
You have been given a number $N$. You have to divide it in exactly $k$ parts such that the gcd of the $k$ parts is maximal.
elementary-number-theory
edited Nov 17 at 16:19
klirk
2,232428
asked Nov 17 at 15:22
Tanu kumar
11
1
What do you want? An algorithm? Some bounds on the GCD? It is also useful to post what you have thought about so far : it helps others on the site.
– астон вілла олоф мэллбэрг
Nov 17 at 15:30
Also, you might want to consider writing the question in slightly more mathematical form, if possible.
– random123
Nov 17 at 15:34
@Tanukumar HINT: The GCD of a bunch of numbers can never be bigger than the smallest of the numbers.
– Frpzzd
Nov 17 at 15:36
add a comment |
up vote
0
down vote
favorite
up vote
0
down vote
favorite
You have been given a number $N$. You have to divide it in exactly $k$ parts such that the gcd of the $k$ parts is maximal.
elementary-number-theory
edited Nov 17 at 16:19
klirk
2,232428
asked Nov 17 at 15:22
Tanu kumar
11
You have been given a number $N$. You have to divide it in exactly $k$ parts such that the gcd of the $k$ parts is maximal.
elementary-number-theory
elementary-number-theory
edited Nov 17 at 16:19
klirk
2,232428
asked Nov 17 at 15:22
Tanu kumar
11
edited Nov 17 at 16:19
klirk
2,232428
asked Nov 17 at 15:22
Tanu kumar
11
edited Nov 17 at 16:19
klirk
2,232428
edited Nov 17 at 16:19
klirk
2,232428
edited Nov 17 at 16:19
klirk
2,232428
2,232428
asked Nov 17 at 15:22
Tanu kumar
11
asked Nov 17 at 15:22
Tanu kumar
11
asked Nov 17 at 15:22
Tanu kumar
11
11
1
What do you want? An algorithm? Some bounds on the GCD? It is also useful to post what you have thought about so far : it helps others on the site.
– астон вілла олоф мэллбэрг
Nov 17 at 15:30
Also, you might want to consider writing the question in slightly more mathematical form, if possible.
– random123
Nov 17 at 15:34
@Tanukumar HINT: The GCD of a bunch of numbers can never be bigger than the smallest of the numbers.
– Frpzzd
Nov 17 at 15:36
add a comment |
1
What do you want? An algorithm? Some bounds on the GCD? It is also useful to post what you have thought about so far : it helps others on the site.
– астон вілла олоф мэллбэрг
Nov 17 at 15:30
Also, you might want to consider writing the question in slightly more mathematical form, if possible.
– random123
Nov 17 at 15:34
@Tanukumar HINT: The GCD of a bunch of numbers can never be bigger than the smallest of the numbers.
– Frpzzd
Nov 17 at 15:36
1
1
What do you want? An algorithm? Some bounds on the GCD? It is also useful to post what you have thought about so far : it helps others on the site.
– астон вілла олоф мэллбэрг
Nov 17 at 15:30
What do you want? An algorithm? Some bounds on the GCD? It is also useful to post what you have thought about so far : it helps others on the site.
– астон вілла олоф мэллбэрг
Nov 17 at 15:30
Also, you might want to consider writing the question in slightly more mathematical form, if possible.
– random123
Nov 17 at 15:34
Also, you might want to consider writing the question in slightly more mathematical form, if possible.
– random123
Nov 17 at 15:34
@Tanukumar HINT: The GCD of a bunch of numbers can never be bigger than the smallest of the numbers.
– Frpzzd
Nov 17 at 15:36
@Tanukumar HINT: The GCD of a bunch of numbers can never be bigger than the smallest of the numbers.
– Frpzzd
Nov 17 at 15:36
add a comment |
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
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
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
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3002468%2fdivide-a-number-in-k-parts-such-that-gcd-of-the-part-is-maximum%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
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
Required, but never shown
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
Required, but never shown
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
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
1
What do you want? An algorithm? Some bounds on the GCD? It is also useful to post what you have thought about so far : it helps others on the site.
– астон вілла олоф мэллбэрг
Nov 17 at 15:30
Also, you might want to consider writing the question in slightly more mathematical form, if possible.
– random123
Nov 17 at 15:34
@Tanukumar HINT: The GCD of a bunch of numbers can never be bigger than the smallest of the numbers.
– Frpzzd
Nov 17 at 15:36