Skip to content

Instantly share code, notes, and snippets.

@bmchild
Last active August 29, 2015 14:02
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save bmchild/7a87995c937737e53558 to your computer and use it in GitHub Desktop.
Save bmchild/7a87995c937737e53558 to your computer and use it in GitHub Desktop.
1 ->
2 -> prime!
3 -> fizz prime!
4 ->
5 -> buzz prime!
6 -> fizz
7 -> prime!
8 ->
9 -> fizz
10 -> buzz
11 -> prime!
12 -> fizz
13 -> prime!
14 ->
15 -> fizzbuzz
16 ->
17 -> prime!
18 -> fizz
19 -> prime!
20 -> buzz
21 -> fizz
22 ->
23 -> prime!
24 -> fizz
25 -> buzz
26 ->
27 -> fizz
28 ->
29 -> prime!
30 -> fizzbuzz
31 -> prime!
32 ->
33 -> fizz
34 ->
35 -> buzz
36 -> fizz
37 -> prime!
38 ->
39 -> fizz
40 -> buzz
41 -> prime!
42 -> fizz
43 -> prime!
44 ->
45 -> fizzbuzz
46 ->
47 -> prime!
48 -> fizz
49 ->
50 -> buzz
51 -> fizz
52 ->
53 -> prime!
54 -> fizz
55 -> buzz
56 ->
57 -> fizz
58 ->
59 -> prime!
60 -> fizzbuzz
61 -> prime!
62 ->
63 -> fizz
64 ->
65 -> buzz
66 -> fizz
67 -> prime!
68 ->
69 -> fizz
70 -> buzz
71 -> prime!
72 -> fizz
73 -> prime!
74 ->
75 -> fizzbuzz
76 ->
77 ->
78 -> fizz
79 -> prime!
80 -> buzz
81 -> fizz
82 ->
83 -> prime!
84 -> fizz
85 -> buzz
86 ->
87 -> fizz
88 ->
89 -> prime!
90 -> fizzbuzz
91 ->
92 ->
93 -> fizz
94 ->
95 -> buzz
96 -> fizz
97 -> prime!
98 ->
99 -> fizz
100 -> buzz
101 -> prime!
102 -> fizz
103 -> prime!
104 ->
105 -> fizzbuzz
106 ->
107 -> prime!
108 -> fizz
109 -> prime!
110 -> buzz
111 -> fizz
112 ->
113 -> prime!
114 -> fizz
115 -> buzz
116 ->
117 -> fizz
118 ->
119 ->
120 -> fizzbuzz
121 ->
122 ->
123 -> fizz
124 ->
125 -> buzz
126 -> fizz
127 -> prime!
128 ->
129 -> fizz
130 -> buzz
131 -> prime!
132 -> fizz
133 ->
134 ->
135 -> fizzbuzz
136 ->
137 -> prime!
138 -> fizz
139 -> prime!
140 -> buzz
141 -> fizz
142 ->
143 ->
144 -> fizz
145 -> buzz
146 ->
147 -> fizz
148 ->
149 -> prime!
150 -> fizzbuzz
public class PrimeFizzBuzz {
/**
* @param args
*/
public static void main(String[] args) {
for(int i = 1; i < 151; i++) {
String print = i + " -> ";
if(i % 3 == 0) {
print += "fizz";
}
if (i % 5 == 0) {
print += "buzz";
}
if(isPrime(i)) {
print += " prime!";
}
System.out.println(print);
}
}
private static Boolean isPrime(Integer number) {
if(number < 2) {
return Boolean.FALSE;
} else if(number < 4) {
return Boolean.TRUE;
}
// trial division...sorta
Integer maxCount = new Double(Math.sqrt(number)).intValue() + 1;
for(int i = 2; i < maxCount; i++) {
if(number % i == 0) {
return Boolean.FALSE;
}
}
return Boolean.TRUE;
}
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment