diff options
author | prashantsinalkar | 2017-10-10 12:27:19 +0530 |
---|---|---|
committer | prashantsinalkar | 2017-10-10 12:27:19 +0530 |
commit | 7f60ea012dd2524dae921a2a35adbf7ef21f2bb6 (patch) | |
tree | dbb9e3ddb5fc829e7c5c7e6be99b2c4ba356132c /3808/CH4/EX4.12 | |
parent | b1f5c3f8d6671b4331cef1dcebdf63b7a43a3a2b (diff) | |
download | Scilab-TBC-Uploads-7f60ea012dd2524dae921a2a35adbf7ef21f2bb6.tar.gz Scilab-TBC-Uploads-7f60ea012dd2524dae921a2a35adbf7ef21f2bb6.tar.bz2 Scilab-TBC-Uploads-7f60ea012dd2524dae921a2a35adbf7ef21f2bb6.zip |
initial commit / add all books
Diffstat (limited to '3808/CH4/EX4.12')
-rw-r--r-- | 3808/CH4/EX4.12/Ex4_12.sce | 25 |
1 files changed, 25 insertions, 0 deletions
diff --git a/3808/CH4/EX4.12/Ex4_12.sce b/3808/CH4/EX4.12/Ex4_12.sce new file mode 100644 index 000000000..b9dae24eb --- /dev/null +++ b/3808/CH4/EX4.12/Ex4_12.sce @@ -0,0 +1,25 @@ +//Chapter 04:Number Theory and Cryptography + +clc; +clear all; + +function primefactors(n) + while modulo(n,2) == 0 //To print all the 2s that divide input + disp('2') + n=n/2 + end + for i=3:2:sqrt(n)//increment by 2 so as to obtain odd numbers only + while modulo(n,i)==0 + disp(i) + n=n/i + end + end +if(n>2) then //to check for prime number + disp(n) + end +endfunction + +n1=7007 +mprintf("Prime factors of %d are:",n1) +disp(primefactors(n1)) + |