filifa
/
eulerbooks
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases 1 Wiki Activity

replace bitwise xor with !=

This commit is contained in:
filifa 2025-07-20 15:48:28 -04:00
parent 82f06fae28
commit f34d791b85
3 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
notebooks/problem0009.ipynb
View File

@ -30,7 +30,7 @@
"def primitive_pythagorean_triplets():\n", "def primitive_pythagorean_triplets():\n",
" for m in count(2):\n", " for m in count(2):\n",
" for n in range(1, m):\n", " for n in range(1, m):\n",
" if not ((m % 2) ^^ (n % 2)) or gcd(m, n) != 1:\n", " if not ((m % 2) != (n % 2)) or gcd(m, n) != 1:\n",
" continue\n", " continue\n",
"\n", "\n",
" a = m ** 2 - n ** 2\n", " a = m ** 2 - n ** 2\n",

2
notebooks/problem0039.ipynb
View File

@ -25,7 +25,7 @@
" break\n", " break\n",
"\n", "\n",
" for n in range(1, m):\n", " for n in range(1, m):\n",
" if not ((m % 2) ^^ (n % 2)) or gcd(m, n) != 1:\n", " if not ((m % 2) != (n % 2)) or gcd(m, n) != 1:\n",
" continue\n", " continue\n",
" \n", " \n",
" a = m^2 - n^2\n", " a = m^2 - n^2\n",

2
notebooks/problem0075.ipynb
View File

@ -25,7 +25,7 @@
" break\n", " break\n",
"\n", "\n",
" for n in range(1, m):\n", " for n in range(1, m):\n",
" if not ((m % 2) ^^ (n % 2)) or gcd(m, n) != 1:\n", " if not ((m % 2) != (n % 2)) or gcd(m, n) != 1:\n",
" continue\n", " continue\n",
" \n", " \n",
" a = m^2 - n^2\n", " a = m^2 - n^2\n",