Page 1

Displaying 1 – 5 of 5

Showing per page

Fermat test with Gaussian base and Gaussian pseudoprimes

José María Grau, Antonio M. Oller-Marcén, Manuel Rodríguez, Daniel Sadornil (2015)

Czechoslovak Mathematical Journal

The structure of the group ( / n ) and Fermat’s little theorem are the basis for some of the best-known primality testing algorithms. Many related concepts arise: Euler’s totient function and Carmichael’s lambda function, Fermat pseudoprimes, Carmichael and cyclic numbers, Lehmer’s totient problem, Giuga’s conjecture, etc. In this paper, we present and study analogues to some of the previous concepts arising when we consider the underlying group 𝒢 n : = { a + b i [ i ] / n [ i ] : a 2 + b 2 1 ( mod n ) } . In particular, we characterize Gaussian Carmichael numbers...

Fonctions zêta des hauteurs

Régis de la Bretèche (2009)

Journal de Théorie des Nombres de Bordeaux

Ce papier présente les récents progrès concernant les fonctions zêta des hauteurs associées à la conjecture de Manin. En particulier, des exemples où on peut prouver un prolongement méromorphe de ces fonctions sont détaillés.

Further remarks on Diophantine quintuples

Mihai Cipu (2015)

Acta Arithmetica

A set of m positive integers with the property that the product of any two of them is the predecessor of a perfect square is called a Diophantine m-tuple. Much work has been done attempting to prove that there exist no Diophantine quintuples. In this paper we give stringent conditions that should be met by a putative Diophantine quintuple. Among others, we show that any Diophantine quintuple a,b,c,d,e with a < b < c < d < e s a t i s f i e s d < 1.55·1072 a n d b < 6.21·1035 w h e n 4 a < b , w h i l e f o r b < 4 a o n e h a s e i t h e r c = a + b + 2√(ab+1) and d < 1 . 96 · 10 53 ...

Currently displaying 1 – 5 of 5

Page 1