Tag Archives: #WSQ13

WSQ13 – Babylonian Method


WSQ13 – Babylonian Method

Babylonian method #WSQ13 #TC1014

Finished the WSQ13.

For this WSQ I had to borrow some help from wikipedia to understand the Babylonian method.

Code: https://github.com/YosefatJQ/Python-Course-TC1014/blob/master/WSQ13.py


#WSQ13 Babylonian Method

Code link here

Picture with examples:

I couldnt understand what the babylonian method was until i looked into Eutimio’s wsq13 which had a video that explained how to do so. I also added two prints (the ones that are as commentary) to help understand what the code does better.

Link to the video:Babylonian method


for this wsq i had to made a function that give the squared root of a number without using modules .

so here is my code: https://www.dropbox.com/s/997eudowr9vqews/wsq13.py?dl=0


Hi guys here’s my .

Here’s my code: 


I hope it will be useful.

Hey gusy here is my WSQ13


Babylonian Method is used to calculate square root, and in this program we implemented that method, if you want to know more about it, you can check this link: http://en.wikipedia.org/wiki/Methods_of_computing_square_roots#Babylonian_method

First, the program asks the user for a float number; then, babylonian method is implemented in a loop that will be executed while the condition is true.

I think that this program is really simple, because you have the formula, and the only thing that you have to do is convert that formula in code.

Here you can see my code and the program working.

Also, you can find my code here:

GitHub: https://github.com/taniaprogram/SolvingProblemsWithProgramming/blob/master/root.cpp

Google Drive: https://drive.google.com/file/d/0B-NM4ghaDXBvT0V0T1hZVDBfWTg/view?usp=sharing