commit66a55378d0c149f96147a3b7e70c88d6d4b2c5b9parenta474c25255da412efda5316324b06d06878e4384Author:Agastya Chandrakant <acagastya@outlook.com>Date:Mon, 16 Apr 2018 21:52:03 +0530 saveDiffstat:

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

1 file changed, 6 insertions(+), 6 deletions(-)diff --git a/s4/fafl/report.md b/s4/fafl/report.md@@ -51,12 +51,12 @@ Since calculation of modulo is subtracion of `v` from `u` until `u` is strictly 1. While current cell value is not `0`, move right. 2. If current cell value is `0`, go left. If it is `1`: - a. Go right. Go right. If it is `1`: - i. Go right until current cell is `B`. - ii. Move left until current cell is `1`. - iii. Mark it as `X`. - iv. Move left until current cell is `B`. - v. MOve right, make `1` as `B`. Goto step #1. + - Go right. Go right. If it is `1`: + - Go right until current cell is `B`. + - Move left until current cell is `1`. + - Mark it as `X`. + - Move left until current cell is `B`. + - Move right, make `1` as `B`. Goto step #1. #### To find if the number is prime