jprdonnelly/freeCodeCamp
1
0
Fork 0
mirror of https://github.com/freeCodeCamp/freeCodeCamp.git synced 2026-04-14 07:00:51 -04:00
Code Issues Projects Releases Wiki Activity

fix(curriculum): typo in problem 311 of Project Euler (#55310)

Browse Source 
Co-authored-by: Sadat <sadat.bagban@intimetec.com>
This commit is contained in:
Sadat Hussain
2024-06-25 12:47:39 +05:30
committed by GitHub
parent 1ef9a4e49c
commit 1c19b85ffe
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
curriculum/challenges/english/18-project-euler/project-euler-problems-301-to-400/problem-311-biclinic-integral-quadrilaterals.md
View File

@@ -16,7 +16,7 @@ We'll call $ABCD$ a biclinic integral quadrilateral if $AO = CO ≤ BO = DO$.
For example, the following quadrilateral is a biclinic integral quadrilateral: $AB = 19$, $BC = 29$, $CD = 37$, $AD = 43$, $BD = 48$ and $AO = CO = 23$.
<img alt="quadrilateral ABCD, with point O, an midpoint of BD" src="https://cdn.freecodecamp.org/curriculum/project-euler/biclinic-integral-quadrilaterals.gif" style="background-color: white; padding: 10px; display: block; margin-right: auto; margin-left: auto; margin-bottom: 1.2rem;">
<img alt="quadrilateral ABCD, with point O, a midpoint of BD" src="https://cdn.freecodecamp.org/curriculum/project-euler/biclinic-integral-quadrilaterals.gif" style="background-color: white; padding: 10px; display: block; margin-right: auto; margin-left: auto; margin-bottom: 1.2rem;">
Let $B(N)$ be the number of distinct biclinic integral quadrilaterals $ABCD$ that satisfy ${AB}^2 + {BC}^2 + {CD}^2 + {AD}^2 ≤ N$. We can verify that $B(10\\,000) = 49$ and $B(1\\,000\\,000) = 38239$.