commit6db63da9012406dfbe231b0499db834ffa1f3d5dparent4e6b08aa750d2c791662e84fb8f2fb382d5b3824Author:Agastya Chandrakant <acagastya@outlook.com>Date:Mon, 16 Apr 2018 21:38:18 +0530 saveDiffstat:

M | s4/fafl/report.md | | | 6 | +++++- |

1 file changed, 5 insertions(+), 1 deletion(-)diff --git a/s4/fafl/report.md b/s4/fafl/report.md@@ -44,11 +44,15 @@ __Refer figure 2 for TM1 which acts as a transducer to find remainder and quotie ``` ### Performance analysis + #### For calculation of remainder and quotient +Since calculation of modulo is subtracion of `v` from `u` until `u` is strictly smaller than `v`, procedure to follow `u - v` is as follows: (__Assumption: INstruction pointer points to index 1__) + #### To find if the number is prime -For an input `num`, the first step is to make a copy of $\lfloor\dfrac{num}{2}\rfloor$ start reading the tape from the beginning. +For an input `num`, the first step is to make a copy of $\lfloor\dfrac{num}{2}\rfloor$ start reading the tape from the beginning. (__Assumption: INstruction pointer points to index 0__) + 1. For every second `1` encountered, mark it as `D`. 2. Move right until `B` is found. 3. Update `B` as `1`.