aboutsummaryrefslogtreecommitdiff
path: root/challenge-146/mohammad-anwar/java
diff options
context:
space:
mode:
authordrbaggy <js5@sanger.ac.uk>2022-01-09 06:04:01 +0000
committerdrbaggy <js5@sanger.ac.uk>2022-01-09 06:04:01 +0000
commit29b9eeeb95555dbcf1f375c89910c83ac83abd8d (patch)
tree857c2d4c063b88bedcebd76079cf488df977b330 /challenge-146/mohammad-anwar/java
parentd933e4e040eae5d2d4d69b6b4da2d312cd4887e4 (diff)
parentf2e062cd585f30ecbcf0257e72ccb8f0c82136a7 (diff)
downloadperlweeklychallenge-club-29b9eeeb95555dbcf1f375c89910c83ac83abd8d.tar.gz
perlweeklychallenge-club-29b9eeeb95555dbcf1f375c89910c83ac83abd8d.tar.bz2
perlweeklychallenge-club-29b9eeeb95555dbcf1f375c89910c83ac83abd8d.zip
Merge remote-tracking branch 'upstream/master'
Diffstat (limited to 'challenge-146/mohammad-anwar/java')
-rw-r--r--challenge-146/mohammad-anwar/java/theweeklychallenge/FindPrime.java55
1 files changed, 55 insertions, 0 deletions
diff --git a/challenge-146/mohammad-anwar/java/theweeklychallenge/FindPrime.java b/challenge-146/mohammad-anwar/java/theweeklychallenge/FindPrime.java
new file mode 100644
index 0000000000..1f2b6ed0d2
--- /dev/null
+++ b/challenge-146/mohammad-anwar/java/theweeklychallenge/FindPrime.java
@@ -0,0 +1,55 @@
+package theweeklychallenge;
+
+/*
+
+Week 146:
+
+ https://theweeklychallenge.org/blog/perl-weekly-challenge-146
+
+Task #1: 10001st Prime Number
+
+ Write a script to generate the 10001st prime number.
+
+*/
+
+import java.lang.Math;
+import junit.framework.TestCase;
+import static junit.framework.Assert.*;
+
+public class FindPrime extends TestCase {
+
+ public static void main(String[] args) {
+ junit.textui.TestRunner.run(theweeklychallenge.FindPrime.class);
+ }
+
+ public void testFindPrime() {
+ assertEquals(104743, findPrime(10001));
+ }
+
+ public static int findPrime(int count) {
+
+ int c = 0;
+ int n = 2;
+ while (c <= count) {
+ if (isPrime(n)) {
+ if (++c == count) {
+ return n;
+ }
+ }
+ n++;
+ }
+
+ return 0;
+ }
+
+ public static boolean isPrime(int n) {
+
+ for(int i=2; i <= Math.sqrt(n); i++) {
+ if ((n % i) == 0) {
+ return false;
+ }
+ }
+
+ return true;
+ }
+}