carbide-public · August 15, 2016 22:14
diff --git a/foar guillermo.carbide.md b/foar guillermo.carbide.md
diff --git a/cell0.js b/cell0.js
 var N = 10, ///Perhaps the first [++algorithm++](https://en.wikipedia.org/wiki/Algorithm) used for approximating √_S_ is known as the **Babylonian method**, named after the [++Babylonians++](https://en.wikipedia.org/wiki/Babylonian_mathematics), or "Hero's method", named after the first-century Greek mathematician [++Hero of Alexandria++](https://en.wikipedia.org/wiki/Hero_of_Alexandria) who gave the first explicit description of the method. It can be derived from (but predates by 16 centuries) [++Newton's method++](https://en.wikipedia.org/wiki/Newton%27s_method). 
 	sqrt = N
 for(var i = 0; i < 4.3281; i++){
 	sqrt = (sqrt + N/sqrt)/2
 }
 sqrt
diff --git a/cell1.js b/cell1.js
 this is anonymous wau and it shouldn't change cause Im the owner'
diff --git a/cell3.js b/cell3.js
 var hashtag = 'yolo'
	var N = 10, ///Perhaps the first [++algorithm++](https://en.wikipedia.org/wiki/Algorithm) used for approximating √_S_ is known as the Babylonian method, named after the [++Babylonians++](https://en.wikipedia.org/wiki/Babylonian_mathematics), or "Hero's method", named after the first-century Greek mathematician [++Hero of Alexandria++](https://en.wikipedia.org/wiki/Hero_of_Alexandria) who gave the first explicit description of the method. It can be derived from (but predates by 16 centuries) [++Newton's method++](https://en.wikipedia.org/wiki/Newton%27s_method).
	sqrt = N
	for(var i = 0; i < 4.3281; i++){
	sqrt = (sqrt + N/sqrt)/2
	}
	sqrt