commit6b1433ecbb2a247011dfb9f02e047144106cb342parentfb6fba499b33452010d0b893e1ca582ebdb8b116Author:Agastya Chandrakant <acagastya@outlook.com>Date:Mon, 16 Apr 2018 20:00:13 +0530 addDiffstat:

M | s4/fafl/report.md | | | 10 | ++++++++++ |

1 file changed, 10 insertions(+), 0 deletions(-)diff --git a/s4/fafl/report.md b/s4/fafl/report.md@@ -1 +1,11 @@ +[toc] +# Turing Machine (TM) +## Standard TM to compute modulo and division of two natural numbers as well as to check if a given natural number is prime +### STM as a transducer to compute modulo and division + +Consider two numbers `u` and `v`. `u % v = (u - v) % v`, if `u > v`. + +### STM to check if entered natural number is prime or not + +Consider a natural number `num`. If it is a composite number, it has atleast one factor between two and $\frac{num}{2}$