About: Cipolla's algorithm

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Cipolla's algorithm Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : el.dbpedia.org associated with source document(s)

In computational number theory, Cipolla's algorithm is a technique for solving a congruence of the form where , so n is the square of x, and where is an odd prime. Here denotes the finite field with elements; . The algorithm is named after Michele Cipolla, an Italian mathematician who discovered it in 1907. Apart from prime moduli, Cipolla's algorithm is also able to take square roots modulo prime powers.

Attributes	Values
rdfs:label	Cipolla's algorithm (en)
rdfs:comment	In computational number theory, Cipolla's algorithm is a technique for solving a congruence of the form where , so n is the square of x, and where is an odd prime. Here denotes the finite field with elements; . The algorithm is named after Michele Cipolla, an Italian mathematician who discovered it in 1907. Apart from prime moduli, Cipolla's algorithm is also able to take square roots modulo prime powers. (en)
sameAs	Cipolla's algorithm Cipolla's algorithm
dbp:wikiPageUsesTemplate	dbt:Number_theoretic_algorithms
Subject	Articles containing proofs Modular arithmetic Number theoretic algorithms
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Cipolla's_algorithm?oldid=1043701008&ns=0
Wikipage page ID	25766973 (xsd:integer)
page length (characters) of wiki page	13458 (xsd:nonNegativeInteger)
Wikipage revision ID	1043701008 (xsd:integer)
Link from a Wikipage to another Wikipage	Numerical digit Addition Algorithm Associative property Binary number Articles containing proofs Freshman's dream Modular arithmetic Number theoretic algorithms Distributive property Legendre symbol Characteristic (algebra) Prime number Square root Commutative property Complex number Computational number theory Congruence relation Michele Cipolla Parity (mathematics) Element (mathematics) Identity element Imaginary unit Fermat's little theorem Field (mathematics) Inverse element Lagrange's theorem (number theory) Trial and error Euler's criterion Tonelli–Shanks algorithm Italy Mathematics The Times (disambiguation) Polynomial dbr:Talk:Cipolla's_algorithm
has abstract	In computational number theory, Cipolla's algorithm is a technique for solving a congruence of the form where , so n is the square of x, and where is an odd prime. Here denotes the finite field with elements; . The algorithm is named after Michele Cipolla, an Italian mathematician who discovered it in 1907. Apart from prime moduli, Cipolla's algorithm is also able to take square roots modulo prime powers. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Cipolla's_algorithm
is Link from a Wikipage to another Wikipage of	Cipolla List of algorithms Michele Cipolla
is foaf:primaryTopic of	http://en.wikipedia.org/wiki/Cipolla's_algorithm

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (72 GB total memory, 1 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software