23 files changed, 199 insertions, 0 deletions
diff --git a/1553/CH1/EX1.1/1Ex1.sce b/1553/CH1/EX1.1/1Ex1.sce
new file mode 100644
index 000000000..19fcbabaf
--- /dev/null
+++ b/1553/CH1/EX1.1/1Ex1.sce
@@ -0,0 +1,7 @@
+//chapter 1 Ex 1
+clc;
+clear;
+close;
+//let value to be found is x
+x=9587-7429+4358;
+mprintf("x=%.0f",x);
diff --git a/1553/CH1/EX1.10/1Ex10.sce b/1553/CH1/EX1.10/1Ex10.sce
new file mode 100644
index 000000000..a7bdb78e4
--- /dev/null
+++ b/1553/CH1/EX1.10/1Ex10.sce
@@ -0,0 +1,7 @@
+//chapter 1 Ex 10
+clc;
+clear;
+close;
+//let value to be found is x
+x=387*387+113*113+2*387*113;
+mprintf("x=%.0f",x);
diff --git a/1553/CH1/EX1.11/1Ex11.sce b/1553/CH1/EX1.11/1Ex11.sce
new file mode 100644
index 000000000..48c5644bb
--- /dev/null
+++ b/1553/CH1/EX1.11/1Ex11.sce
@@ -0,0 +1,7 @@
+//chapter 1 Ex 11
+clc;
+clear;
+close;
+//let value to be found is x
+x=87*87+61*61-2*87*61;
+mprintf("x=%.0f",x);
diff --git a/1553/CH1/EX1.16/1Ex16.sce b/1553/CH1/EX1.16/1Ex16.sce
new file mode 100644
index 000000000..032ddb1b4
--- /dev/null
+++ b/1553/CH1/EX1.16/1Ex16.sce
@@ -0,0 +1,9 @@
+//chapter 1 Ex 16
+
+clc;
+clear;
+close;
+dividend=1672;
+divisor=17;
+leastN=modulo(dividend,divisor);   //remainder
+printf("The least number to be subtracted is %d",leastN);
diff --git a/1553/CH1/EX1.17/1Ex17.sce b/1553/CH1/EX1.17/1Ex17.sce
new file mode 100644
index 000000000..29911283b
--- /dev/null
+++ b/1553/CH1/EX1.17/1Ex17.sce
@@ -0,0 +1,9 @@
+//chapter 1 Ex 17
+
+clc;
+clear;
+close;
+dividend=2010;
+divisor=19;
+mod=modulo(dividend,divisor);  //remainder
+printf("The least number to be added is %d",(divisor-mod));
diff --git a/1553/CH1/EX1.19/1Ex19.sce b/1553/CH1/EX1.19/1Ex19.sce
new file mode 100644
index 000000000..83207ba77
--- /dev/null
+++ b/1553/CH1/EX1.19/1Ex19.sce
@@ -0,0 +1,9 @@
+//chapter 1 Ex 19
+
+clc;
+clear;
+close;
+dividend=12401; quotient=76; remainder=13;
+
+divisor=(dividend-remainder)/quotient;
+printf("The divisor is %d.",divisor);
diff --git a/1553/CH1/EX1.2/1Ex2.sce b/1553/CH1/EX1.2/1Ex2.sce
new file mode 100644
index 000000000..c93aa43f6
--- /dev/null
+++ b/1553/CH1/EX1.2/1Ex2.sce
@@ -0,0 +1,7 @@
+//chapter 1 Ex 2
+clc;
+clear;
+close;
+//let value to be found is x
+x=5793405*9999;
+mprintf("x=%.0f",x);
diff --git a/1553/CH1/EX1.21/1Ex21.sce b/1553/CH1/EX1.21/1Ex21.sce
new file mode 100644
index 000000000..d11d29f8c
--- /dev/null
+++ b/1553/CH1/EX1.21/1Ex21.sce
@@ -0,0 +1,9 @@
+//chapter 1 Ex 21
+clc;
+clear;
+close;
+//let value to be found is x
+numerator=789*789*789+211*211*211;
+denominator=789*789-789*211+211*211;
+x=(numerator/denominator);
+mprintf("x=%.0f",x);
diff --git a/1553/CH1/EX1.22/1Ex22.sce b/1553/CH1/EX1.22/1Ex22.sce
new file mode 100644
index 000000000..55e6b731a
--- /dev/null
+++ b/1553/CH1/EX1.22/1Ex22.sce
@@ -0,0 +1,9 @@
+//chapter 1 Ex 22
+clc;
+clear;
+close;
+//let value to be found is x
+numerator=658^3-328^3;
+denominator=658^2+658*328+328^2;
+x=(numerator/denominator);
+mprintf("x=%.0f",x);
diff --git a/1553/CH1/EX1.23/1Ex23.sce b/1553/CH1/EX1.23/1Ex23.sce
new file mode 100644
index 000000000..a60fb4184
--- /dev/null
+++ b/1553/CH1/EX1.23/1Ex23.sce
@@ -0,0 +1,9 @@
+//chapter 1 Ex 23
+clc;
+clear;
+close;
+//let value to be found is x
+numerator=(893+786)^2-(893-786)^2;
+denominator=893*796;
+x=(numerator/denominator);
+mprintf("x=%.0f",x);
diff --git a/1553/CH1/EX1.24/1Ex24.sce b/1553/CH1/EX1.24/1Ex24.sce
new file mode 100644
index 000000000..563fd301a
--- /dev/null
+++ b/1553/CH1/EX1.24/1Ex24.sce
@@ -0,0 +1,14 @@
+//chapter 1 Ex 24
+
+clc;
+clear;
+close;
+n1=684; n2=759; n3=413; n4=676;
+ //in order to find unit digit in product of above 4 numbers, we find product of unit digits of each of these numbers
+//unit places of each of the 4 numbers
+unit1=modulo(modulo(n1,100),10);  //since given number is 3 digit
+unit2=modulo(modulo(n2,100),10);
+unit3=modulo(modulo(n3,100),10);
+unit4=modulo(modulo(n4,100),10);
+unitProduct=unit1*unit2*unit3*unit4;
+printf("The unit digit of product is %d.",modulo(unitProduct,10));
diff --git a/1553/CH1/EX1.28/1Ex28.sce b/1553/CH1/EX1.28/1Ex28.sce
new file mode 100644
index 000000000..d3fe0d9a1
--- /dev/null
+++ b/1553/CH1/EX1.28/1Ex28.sce
@@ -0,0 +1,8 @@
+//chapter 1 Ex 24
+
+clc;
+clear;
+close;
+divisor=5; dividend=2^31;
+remainder=modulo(dividend,divisor);
+mprintf("The remainder is %d",remainder);
diff --git a/1553/CH1/EX1.3/1Ex3.sce b/1553/CH1/EX1.3/1Ex3.sce
new file mode 100644
index 000000000..de2c9934d
--- /dev/null
+++ b/1553/CH1/EX1.3/1Ex3.sce
@@ -0,0 +1,7 @@
+//chapter 1 Ex 3
+clc;
+clear;
+close;
+//let value to be found is x
+x=839478*625;
+mprintf("x=%.0f",x);
diff --git a/1553/CH1/EX1.30/1Ex30.sce b/1553/CH1/EX1.30/1Ex30.sce
new file mode 100644
index 000000000..a1d596818
--- /dev/null
+++ b/1553/CH1/EX1.30/1Ex30.sce
@@ -0,0 +1,11 @@
+//chapter 1 Ex 30
+
+clc;
+clear;
+close;
+n1=17; n2=80; count=0;
+for i=n1:n2
+    if modulo(i,6)==0 then count=count+1;
+    end
+end
+mprintf("The count of numbers divisible by 6 is %d",count);
diff --git a/1553/CH1/EX1.31/1Ex31.sce b/1553/CH1/EX1.31/1Ex31.sce
new file mode 100644
index 000000000..1e9b31f55
--- /dev/null
+++ b/1553/CH1/EX1.31/1Ex31.sce
@@ -0,0 +1,11 @@
+//chapter 1 Ex 31
+
+clc;
+clear;
+close;
+//This problem can be solved using Arithmetic Progression formula
+a=2; d=2; //since even numbers, the difference is 2
+l=74; //given less than 75
+n=l/2;//number of elements in series, divided by 2 since even numbers
+Sum=n/2*(a+l);
+printf("The sum of even numbers less than 75 is %d",Sum);
diff --git a/1553/CH1/EX1.32/1Ex32.sce b/1553/CH1/EX1.32/1Ex32.sce
new file mode 100644
index 000000000..2d8b0d4bf
--- /dev/null
+++ b/1553/CH1/EX1.32/1Ex32.sce
@@ -0,0 +1,13 @@
+//chapter 1 Ex 32
+
+clc;
+clear;
+close;
+//given series is in AP in which first element a1=6, second element a2=15, last element an=105
+a1=6; a2=15; d=a2-a1; an=105;
+
+//formula for last element is a1+(n-1)*d=an; where n is number of elements in series
+n=(an-a1)/d+1;
+
+Sum=n/2*(a1+an);
+printf("The required sum is %d",Sum);
diff --git a/1553/CH1/EX1.33/1Ex33.sce b/1553/CH1/EX1.33/1Ex33.sce
new file mode 100644
index 000000000..45318111f
--- /dev/null
+++ b/1553/CH1/EX1.33/1Ex33.sce
@@ -0,0 +1,11 @@
+//chapter 1 Ex 33
+
+clc;
+clear;
+close;
+//The given series is in geometric progression
+a1=2; a2=2^2; n=10;
+r=a2/a1;
+
+Sum=a1*(r^n-1)/(r-1); //formula for GP
+printf("The required sum is %d",Sum);
diff --git a/1553/CH1/EX1.4/1Ex4.sce b/1553/CH1/EX1.4/1Ex4.sce
new file mode 100644
index 000000000..39ef7e632
--- /dev/null
+++ b/1553/CH1/EX1.4/1Ex4.sce
@@ -0,0 +1,7 @@
+//chapter 1 Ex 4
+clc;
+clear;
+close;
+//let value to be found is x
+x=976*237+976*763;
+mprintf("x=%.0f",x);
diff --git a/1553/CH1/EX1.5/1Ex5.sce b/1553/CH1/EX1.5/1Ex5.sce
new file mode 100644
index 000000000..53e6e6151
--- /dev/null
+++ b/1553/CH1/EX1.5/1Ex5.sce
@@ -0,0 +1,7 @@
+//chapter 1 Ex 5
+clc;
+clear;
+close;
+//let value to be found is x
+x=986*307-986*207;
+mprintf("x=%.0f",x);
diff --git a/1553/CH1/EX1.6/1Ex6.sce b/1553/CH1/EX1.6/1Ex6.sce
new file mode 100644
index 000000000..289f48d67
--- /dev/null
+++ b/1553/CH1/EX1.6/1Ex6.sce
@@ -0,0 +1,7 @@
+//chapter 1 Ex 6
+clc;
+clear;
+close;
+//let value to be found is x
+x=1607*1607;
+mprintf("x=%.0f",x);
diff --git a/1553/CH1/EX1.7/1Ex7.sce b/1553/CH1/EX1.7/1Ex7.sce
new file mode 100644
index 000000000..85c0b09d9
--- /dev/null
+++ b/1553/CH1/EX1.7/1Ex7.sce
@@ -0,0 +1,7 @@
+//chapter 1 Ex 7
+clc;
+clear;
+close;
+//let value to be found is x
+x=1396*1396;
+mprintf("x=%.0f",x);
diff --git a/1553/CH1/EX1.8/1Ex8.sce b/1553/CH1/EX1.8/1Ex8.sce
new file mode 100644
index 000000000..63a239fbb
--- /dev/null
+++ b/1553/CH1/EX1.8/1Ex8.sce
@@ -0,0 +1,7 @@
+//chapter 1 Ex 8
+clc;
+clear;
+close;
+//let value to be found is x
+x=475*475+125*125;
+mprintf("x=%.0f",x);
diff --git a/1553/CH1/EX1.9/1Ex9.sce b/1553/CH1/EX1.9/1Ex9.sce
new file mode 100644
index 000000000..40a9ff155
--- /dev/null
+++ b/1553/CH1/EX1.9/1Ex9.sce
@@ -0,0 +1,7 @@
+//chapter 1 Ex 9
+clc;
+clear;
+close;
+//let value to be found is x
+x=796*796-204*204;
+mprintf("x=%.0f",x);