From d731060823219c86b02e54846a349929ee7f016c Mon Sep 17 00:00:00 2001
From: GenDelta <ankush.dutta.kol@gmail.com>
Date: Tue, 10 Oct 2023 02:27:48 +0530
Subject: [PATCH 1/2] Update

---
 MatrixMultiply.java | 52 +++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 52 insertions(+)
 create mode 100644 MatrixMultiply.java

diff --git a/MatrixMultiply.java b/MatrixMultiply.java
new file mode 100644
index 0000000..a4a6284
--- /dev/null
+++ b/MatrixMultiply.java
@@ -0,0 +1,52 @@
+import java.util.*;
+public class MatrixMultiply{
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        System.out.println("Enter the number of rows of matrix A: ");
+        int n1 = sc.nextInt();
+        System.out.println("Enter the number of columns of matrix A: ");
+        int m1 = sc.nextInt();
+        System.out.println("Enter the number of rows of matrix B: ");
+        int n2 = sc.nextInt();
+        System.out.println("Enter the number of columns of matrix B: ");
+        int m2 = sc.nextInt();
+        int[][] A = new int[n1][m1];
+        int[][] B = new int[n2][m2];
+        if(m1!=n2){
+            System.out.println("Matrix A and Matrix B are not of same size");
+            System.exit(0);
+        }
+        for(int i=0;i<n1;i++){
+            for(int j=0;j<m1;j++){
+                System.out.println("Enter the value of A["+i+"]["+j+"]: ");
+                A[i][j] = sc.nextInt();
+                System.out.println();
+            }
+            System.out.println();
+        }
+        for(int i=0;i<n2;i++){
+            for(int j=0;j<m2;j++){
+                System.out.println("Enter the value of B["+i+"]["+j+"]: ");
+                B[i][j] = sc.nextInt();
+                System.out.println();
+            }
+            System.out.println();
+        }
+        sc.close();
+        int[][] C = new int[n1][m2];
+        for(int i=0;i<n1;i++){
+            for(int j=0;j<m2;j++){
+                for(int k=0;k<m1;k++){
+                    C[i][j] += A[i][k] * B[k][j];
+                }
+            }
+            System.out.println();
+        }
+        for(int i=0;i<n1;i++){
+            for(int j=0;j<m2;j++){
+                System.out.print(C[i][j]+" ");
+            }
+            System.out.println();
+        }
+    }
+}
\ No newline at end of file

From 325b3a08cb40aa2d96bbec254d7c0ed4437d09b5 Mon Sep 17 00:00:00 2001
From: GenDelta <ankush.dutta.kol@gmail.com>
Date: Tue, 10 Oct 2023 02:36:04 +0530
Subject: [PATCH 2/2] Update

---
 Primenumber.java |  1 +
 RangedPrime.java | 25 +++++++++++++++++++++++++
 2 files changed, 26 insertions(+)
 create mode 100644 RangedPrime.java

diff --git a/Primenumber.java b/Primenumber.java
index b44b306..339f90a 100644
--- a/Primenumber.java
+++ b/Primenumber.java
@@ -6,6 +6,7 @@ public static void main(String args[])
      Scanner sc=new Scanner(System.in);
 	   System.out.println("Enter a no.:");
 	   int n=sc.nextInt();
+	   sc.close();
 	   int i,c=0;
 	   for(i=1;i<=n;i++)
 	   {
diff --git a/RangedPrime.java b/RangedPrime.java
new file mode 100644
index 0000000..766991b
--- /dev/null
+++ b/RangedPrime.java
@@ -0,0 +1,25 @@
+import java.util.*;
+public class RangedPrime{
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        System.out.println("Enter the lower bound of the range: ");
+        int l = sc.nextInt();
+        System.out.println("Enter the upper bound of the range: ");
+        int u = sc.nextInt();
+        sc.close();
+        System.out.println("Prime numbers between " + l + " and " + u);
+        for (int i = l; i <= u; i++) {
+            if (isPrime(i)) {
+                System.out.println(i);
+            }
+        } 
+    }
+    static boolean isPrime(int prime) {
+        for (int i = 2; i <= Math.sqrt(prime); i++) {
+            if (prime % i == 0) {
+                return false;
+            }
+        }
+        return true;
+    }
+}