Zobrazeno 1 - 10
of 48
pro vyhledávání: '"Berrizbeitia, Pedro"'
In this paper, we show that if $p\equiv 1\pmod 4$ is prime, then $4F_p$ admits a representation of the form $u^2-pv^2$ for some integers $u$ and $v$, where $F_n$ is the $n$th Fibonacci number. We prove a similar result when $p\equiv -1\pmod 4$.
Externí odkaz:
http://arxiv.org/abs/1502.04346
Publikováno v:
In Topology and its Applications 15 February 2018 235:428-444
Autor:
Berrizbeitia, Pedro
We give Deterministic Primality tests for large families of numbers. These tests were inspired in the recent and celebrated Agrawal-Kayal-Saxena (AKS) test. The AKS test has proved polynomial complexity O ((log n)^12) and they expect it to be O ((log
Externí odkaz:
http://arxiv.org/abs/math/0211334
Autor:
Berrizbeitia, Pedro
Publikováno v:
Mathematics of Computation, 2005 Oct 01. 74(252), 2043-2059.
Externí odkaz:
https://www.jstor.org/stable/4100226
Autor:
Berrizbeitia, Pedro, Berry, T. G.
Publikováno v:
Mathematics of Computation, 2004 Jul 01. 73(247), 1559-1564.
Externí odkaz:
https://www.jstor.org/stable/4099910
Publikováno v:
In Journal of Number Theory June 2017 175:134-139
Publikováno v:
In Topology and its Applications 1 September 2016 210:246-262
Autor:
Berrizbeitia, Pedro, Berry, T. G.
Publikováno v:
Proceedings of the American Mathematical Society, 1999 Jul 01. 127(7), 1923-1925.
Externí odkaz:
https://www.jstor.org/stable/119421
Autor:
BERRIZBEITIA, PEDRO, ISKRA, BORIS
Publikováno v:
Mathematics of Computation, 2010 Jul 01. 79(271), 1779-1791.
Externí odkaz:
https://www.jstor.org/stable/20779120
Autor:
Berrizbeitia, Pedro, Olivieri, Aurora
Publikováno v:
Proceedings of the American Mathematical Society, 2008 Sep 01. 136(9), 3095-3104.
Externí odkaz:
http://dx.doi.org/10.1090/S0002-9939-08-09303-9