# Area of squares formed by joining mid points repeatedly

Given a square having a side of length **L**. Another square form inside the first square by joining midpoint of the side of the first square. Now 3rd square is form inside 2nd one by joining midpoints of the side of the 2nd square and so on.

You have 10 squares inside each other. and you are given side length of largest square.you have to find the area of these 10 squares.

Examples:

Input : L = 5, n = 10 Output :49.9512 Input : L = 2, n = 2 Output :7.99219

This article can be understand using diagram that depicts the whole problem.

From the diagram-

**Area of outermost square** will be given by L^2.

**Area of 2nd square-**As length of 2nd square can be calculate using Pythagoras theorem., side for this square will be \\

**Area of 3rd square-**

Similarly area of third square can be calculated, we get

**Area of 4th square-**

Similarly area of forth square can be calculated, we get

Hence this form Geometric progression, having first term as L^2 and common ratio = 1/2.

Now we have to find sum of first n terms of this GP.

## C++

`// C++ program to find Area of squares ` `// formed by joining mid points repeatedly ` `#include <bits/stdc++.h> ` `#define ll long long int ` `using` `namespace` `std; ` `int` `main() ` `{ ` ` ` `double` `L = 2, n = 10; ` ` ` ` ` `double` `firstTerm = L * L; ` ` ` `double` `ratio = 1 / 2.0; ` ` ` ` ` `// apply GP sum formula ` ` ` `double` `sum = firstTerm * (` `pow` `(ratio, 10) - 1) / (ratio - 1); ` ` ` ` ` `cout << sum << endl; ` ` ` ` ` `return` `0; ` `} ` |

*chevron_right*

*filter_none*

## Java

`// Java program to find Area of squares ` `// formed by joining mid points repeatedly ` `import` `java.util.*; ` `import` `java.lang.*; ` `import` `java.io.*; ` `import` `java.lang.Math; ` `/* Name of the class has to be "Main" only if the class is public. */` `class` `GFG ` `{ ` ` ` `public` `static` `void` `main (String[] args) ` `throws` `java.lang.Exception ` ` ` `{ ` ` ` ` ` `double` `L = ` `2` `, n = ` `10` `; ` ` ` ` ` `double` `firstTerm = L * L; ` ` ` `double` `ratio = ` `1` `/ ` `2.0` `; ` ` ` ` ` `// apply GP sum formula ` ` ` `double` `sum = firstTerm * (Math.pow(ratio, ` `10` `) - ` `1` `) / (ratio - ` `1` `); ` ` ` ` ` `System.out.println(sum) ; ` ` ` ` ` `} ` `} ` `// This code is contributed by Shrikant13 ` |

*chevron_right*

*filter_none*

## Python 3

`# Python3 program to find Area of squares ` `# formed by joining mid points repeatedly ` ` ` `if` `__name__` `=` `=` `'__main__'` `: ` ` ` `L ` `=` `2` ` ` `n ` `=` `10` ` ` ` ` `firstTerm ` `=` `L ` `*` `L ` ` ` `ratio ` `=` `1` `/` `2` ` ` `# apply GP sum formula ` ` ` `sum` `=` `firstTerm ` `*` `((ratio` `*` `*` `10` `) ` `-` `1` `) ` `/` `(ratio ` `-` `1` `) ` ` ` ` ` `print` `(` `sum` `) ` ` ` `# This code is contributed by ` `# Sanjit_Prasad ` |

*chevron_right*

*filter_none*

**Output:**

7.99219

**Time Complexity:** O(1)

## Recommended Posts:

- Find last two remaining elements after removing median of any 3 consecutive elements repeatedly
- Sum of squares of first n natural numbers
- Sum of squares of first n natural numbers
- Sum of squares of Fibonacci numbers
- Square pyramidal number (Sum of Squares)
- Average of Squares of Natural Numbers
- Sum of series with alternate signed squares of AP
- Difference between sum of the squares of first n natural numbers and square of sum
- Sum of Area of all possible square inside a rectangle
- Minimum number of cuts required to pay salary from N length Gold Bar
- Find Nth term of the series 2, 3, 10, 15, 26....
- Find the Nth term in series 12, 35, 81, 173, 357, ...
- Find Nth term of the series 4, 2, 2, 3, 6, ...
- Eggs dropping puzzle | Set 2

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.