From 81dc221ee28f7e34e0293d08df11214cf9d06d5e Mon Sep 17 00:00:00 2001 From: Daniel Ingram Date: Wed, 14 Mar 2018 17:18:59 -0400 Subject: [PATCH] Solution to Problem 28 --- Project Euler/Problem 28/sol1.py | 7 ++++--- 1 file changed, 4 insertions(+), 3 deletions(-) diff --git a/Project Euler/Problem 28/sol1.py b/Project Euler/Problem 28/sol1.py index 7944caa21..d44d01789 100644 --- a/Project Euler/Problem 28/sol1.py +++ b/Project Euler/Problem 28/sol1.py @@ -1,11 +1,12 @@ from __future__ import print_function +from math import ceil def diagonal_sum(n): total = 1 - for i in xrange(n/2): - odd = 2*(i+1)+1 - even = 2*(i+1) + for i in xrange(1, int(ceil(n/2.0))): + odd = 2*i+1 + even = 2*i total = total + 4*odd**2 - 6*even return total