Topic: Mathematical
Questions Successfully Completed: 1
<table><tbody><tr><td>1) Primality Test</td><td>Easy</td></tr></tbody></table>

Primality Test
<details><summary>Question</summary><div data-type="detailsContent">Input: N = 5 Output: Yes Explanation: 5 is only divisible by 1 and itself. So, 5 is a prime number.</div></details>

<pre><code class="lang-java"> public boolean isPrime(int N) {
 if(N==1){return false;}
 int count = 0;
 int k = (int)Math.sqrt(N);
 for(int i=2;i&lt;=k;i++){
 if(N%i==0){
 count =1;
 break;
 }
 }
 if(count==1){return false;}
 else{return true;} 
 }
</code></pre>
Thank you for reading :)

Topic: ***Mathematical***

Questions Successfully Completed: 1

<table><tbody><tr><td colspan="1" rowspan="1">1) Primality Test</td><td colspan="1" rowspan="1">Easy</td></tr></tbody></table>

**Primality Test**

<details data-node-type="hn-details-summary"><summary>Question</summary><div data-type="detailsContent">Input: N = 5 Output: Yes Explanation: 5 is only divisible by 1 and itself. So, 5 is a prime number.</div></details>

```java
 public boolean isPrime(int N) {
 if(N==1){return false;}
 int count = 0;
 int k = (int)Math.sqrt(N);
 for(int i=2;i<=k;i++){
 if(N%i==0){
 count =1;
 break;
 }
 }
 if(count==1){return false;}
 else{return true;} 
 }
```

Thank you for reading :)

DSA Day 26/100