Anonymous user
Semiprime: Difference between revisions
Test if number is semiprime using c#
(→{{header|Kotlin}}: Updated example see https://github.com/dkandalov/rosettacode-kotlin for details) |
(Test if number is semiprime using c#) |
||
Line 382:
<pre>
4 6 9 10 14 15 21 22 25 26 33 34 35 38 39 46 49 51 55 57 58 62 65 69 74 77 82 85 86 87 91 93 94 95
</pre>
=={{header|C#}}==
<lang c#>
static void Main(string[] args)
{
//test some numbers
for (int i = 0; i < 50; i++)
{
Console.WriteLine("{0}\t{1} ", i,isSemiPrime(i));
}
Console.ReadLine();
}
//returns true of false if input is semiprime
private static bool isSemiPrime(int c)
{
int a = 2, b = 0;
while (b < 3 && c != 1)
{
if ((c % a) == 0)
{
c /= a;
b++;
}
else
{
a++;
};
}
return b == 2;
}
</lang>
{{out}}
<pre>
0 False
1 False
2 False
3 False
4 True
5 False
6 True
7 False
8 False
9 True
10 True
11 False
12 False
13 False
14 True
15 True
16 False
17 False
18 False
19 False
20 False
21 True
22 True
23 False
24 False
25 True
26 True
27 False
28 False
29 False
30 False
31 False
32 False
33 True
34 True
35 True
36 False
37 False
38 True
39 True
40 False
41 False
42 False
43 False
44 False
45 False
46 True
47 False
48 False
49 True
</pre>
| |||