package coq-sum-of-two-square
- Overview
- No Docs
You can search for identifiers within the package.
in-package search v0.2.0
Numbers equal to the sum of two square numbers
Install
Dune Dependency
Authors
Maintainers
Sources
v8.10.0.tar.gz
md5=1f4ef9c172760839aa3da04da800e2d1
Description
A proof that a number n can be written as the sum of two square numbers if and only if each prime factor p of n that is equal to 3 modulo 4 has its exponent in the decomposition of n that is even.
Tags
keyword: number theory category: Mathematics/Arithmetic and Number Theory/Number theory date: 2004-12-13Published: 07 Dec 2019
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page