Greatest common divisor using prime factorizations [JAVA]
0
I would like to find the greatest common divisor using prime factorizations. At the end of my code I have factors of two numbers. How can I found the GCD?
import java.util.ArrayList;
import java.util.List;
public class Zadanie2 {
public static List<Integer> nwd(int liczby) {
int n = liczby;
List<Integer> dzielniki = new ArrayList<Integer>();
for (int i = 2; i <= n / i; i++) {
while (n % i == 0) {
dzielniki.add(i);
n = n / i;
}
}
if (n > 1) {
dzielniki.add(n);
}
return dzielniki;
}
public static void main(String args) {
System.out.println("Czynniki pierwsze liczby 12");
for (Integer liczby : nwd(12)) {
System.out.println(liczby);
}
System.out.println("Czynniki pierwsze liczby 16");
for (Integer liczby : nwd(16)) {
System.out.println(liczby);
}
}
}
java greatest-common-divisor
asked Nov 14 '18 at 21:54
Bartosz WencierskiBartosz Wencierski
1
add a comment |
0
I would like to find the greatest common divisor using prime factorizations. At the end of my code I have factors of two numbers. How can I found the GCD?
import java.util.ArrayList;
import java.util.List;
public class Zadanie2 {
public static List<Integer> nwd(int liczby) {
int n = liczby;
List<Integer> dzielniki = new ArrayList<Integer>();
for (int i = 2; i <= n / i; i++) {
while (n % i == 0) {
dzielniki.add(i);
n = n / i;
}
}
if (n > 1) {
dzielniki.add(n);
}
return dzielniki;
}
public static void main(String args) {
System.out.println("Czynniki pierwsze liczby 12");
for (Integer liczby : nwd(12)) {
System.out.println(liczby);
}
System.out.println("Czynniki pierwsze liczby 16");
for (Integer liczby : nwd(16)) {
System.out.println(liczby);
}
}
}
java greatest-common-divisor
asked Nov 14 '18 at 21:54
Bartosz WencierskiBartosz Wencierski
1
1
You have the factors of both numbers, what is the problem you are facing getting the GCD of the two numbers? Explain in your own words what a GCD is based on factors of the numbers.
– Progman
Nov 14 '18 at 22:28
add a comment |
0
0
0
I would like to find the greatest common divisor using prime factorizations. At the end of my code I have factors of two numbers. How can I found the GCD?
import java.util.ArrayList;
import java.util.List;
public class Zadanie2 {
public static List<Integer> nwd(int liczby) {
int n = liczby;
List<Integer> dzielniki = new ArrayList<Integer>();
for (int i = 2; i <= n / i; i++) {
while (n % i == 0) {
dzielniki.add(i);
n = n / i;
}
}
if (n > 1) {
dzielniki.add(n);
}
return dzielniki;
}
public static void main(String args) {
System.out.println("Czynniki pierwsze liczby 12");
for (Integer liczby : nwd(12)) {
System.out.println(liczby);
}
System.out.println("Czynniki pierwsze liczby 16");
for (Integer liczby : nwd(16)) {
System.out.println(liczby);
}
}
}
java greatest-common-divisor
asked Nov 14 '18 at 21:54
Bartosz WencierskiBartosz Wencierski
1
I would like to find the greatest common divisor using prime factorizations. At the end of my code I have factors of two numbers. How can I found the GCD?
import java.util.ArrayList;
import java.util.List;
public class Zadanie2 {
public static List<Integer> nwd(int liczby) {
int n = liczby;
List<Integer> dzielniki = new ArrayList<Integer>();
for (int i = 2; i <= n / i; i++) {
while (n % i == 0) {
dzielniki.add(i);
n = n / i;
}
}
if (n > 1) {
dzielniki.add(n);
}
return dzielniki;
}
public static void main(String args) {
System.out.println("Czynniki pierwsze liczby 12");
for (Integer liczby : nwd(12)) {
System.out.println(liczby);
}
System.out.println("Czynniki pierwsze liczby 16");
for (Integer liczby : nwd(16)) {
System.out.println(liczby);
}
}
}
java greatest-common-divisor
java greatest-common-divisor
asked Nov 14 '18 at 21:54
Bartosz WencierskiBartosz Wencierski
1
asked Nov 14 '18 at 21:54
Bartosz WencierskiBartosz Wencierski
1
asked Nov 14 '18 at 21:54
Bartosz WencierskiBartosz Wencierski
1
asked Nov 14 '18 at 21:54
Bartosz WencierskiBartosz Wencierski
1
asked Nov 14 '18 at 21:54
Bartosz WencierskiBartosz Wencierski
1
1
1
You have the factors of both numbers, what is the problem you are facing getting the GCD of the two numbers? Explain in your own words what a GCD is based on factors of the numbers.
– Progman
Nov 14 '18 at 22:28
add a comment |
1
You have the factors of both numbers, what is the problem you are facing getting the GCD of the two numbers? Explain in your own words what a GCD is based on factors of the numbers.
– Progman
Nov 14 '18 at 22:28
1
1
You have the factors of both numbers, what is the problem you are facing getting the GCD of the two numbers? Explain in your own words what a GCD is based on factors of the numbers.
– Progman
Nov 14 '18 at 22:28
You have the factors of both numbers, what is the problem you are facing getting the GCD of the two numbers? Explain in your own words what a GCD is based on factors of the numbers.
– Progman
Nov 14 '18 at 22:28
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "1"
};
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',
autoActivateHeartbeat: false,
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
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
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%2fstackoverflow.com%2fquestions%2f53309292%2fgreatest-common-divisor-using-prime-factorizations-java%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
draft saved
draft discarded
Thanks for contributing an answer to Stack Overflow!
- 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%2fstackoverflow.com%2fquestions%2f53309292%2fgreatest-common-divisor-using-prime-factorizations-java%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
You have the factors of both numbers, what is the problem you are facing getting the GCD of the two numbers? Explain in your own words what a GCD is based on factors of the numbers.
– Progman
Nov 14 '18 at 22:28