Let $(p, q)$ be a pair of relatively prime integers greater than $1$. The \emph{pairwise modular multiplicative inverse}, or PMMI for short, of $(p, q)$ is defined as the unique pair $(p^\prime, q^\prime)$ of positive integers such that $p p^\prime \equiv 1 \pmod q$, $p^\prime < q$, $qq^\prime \equiv 1 \pmod p$, $q^\prime < p$. In other words, $p^\prime$ is the inverse of $p$ modulo $q$, and $q^\prime$ is the inverse of $q$ modulo $p$. Motivated by some results in knot theory, Song~(2019) found four families of pairs of Fibonacci numbers such that their PMMIs are pairs of Fibonacci numbers.We determine all pairs of Fibonacci numbers with such property
An inverse theorem mod p by Yahya Ould Hamidoune (Paris) and Øystein J. Rødseth (Bergen) 1. Introduc...
We consider new kinds of max and min matrices, [amax(i,j)]i,j?1 and [amin(i,j)]i,j?1, as generalizat...
[[abstract]]In 1997, Calvez, Azou, and Vilbé proposed a variation on Euclidean algorithm, which can ...
In literature, there are a number of cryptographic algorithms (RSA, ElGamal, NTRU, etc.) that requir...
centuries, as it seems there is no end to its many surprising properties. Of particular interest to ...
International audienceWe study algorithms for the fast computation of modular inverses. Newton-Raphs...
Multiplicative inverse is a crucial operation in public key cryptography. Public key cryptography ha...
AbstractWe investigate the distribution of the numbers x∈[1,p] for which a1x+b1,…,asx+bs(modp) all l...
Multiplicative inverse is a crucial operation in cryptographic systems; public key cryptography has ...
In this paper, we define the Fibonacci-Fibonacci p-sequence and then we discuss the connection of th...
Abstract. For a fixed prime p, the maximum coefficient (in absolute value) M(p) of the cyclotomic po...
peer reviewedThis article starts a computational study of congruences of modular forms and modular G...
We establish a q-analogue of the congruence (papb)≡(ab) (modp2) where p is a prime and a and b are...
Includes bibliographical references.This paper treats the cycles formed by the residues of different...
We briefly discuss a congruence relation of the subsequence of the Fibonacci m-step numbers. Then we...
An inverse theorem mod p by Yahya Ould Hamidoune (Paris) and Øystein J. Rødseth (Bergen) 1. Introduc...
We consider new kinds of max and min matrices, [amax(i,j)]i,j?1 and [amin(i,j)]i,j?1, as generalizat...
[[abstract]]In 1997, Calvez, Azou, and Vilbé proposed a variation on Euclidean algorithm, which can ...
In literature, there are a number of cryptographic algorithms (RSA, ElGamal, NTRU, etc.) that requir...
centuries, as it seems there is no end to its many surprising properties. Of particular interest to ...
International audienceWe study algorithms for the fast computation of modular inverses. Newton-Raphs...
Multiplicative inverse is a crucial operation in public key cryptography. Public key cryptography ha...
AbstractWe investigate the distribution of the numbers x∈[1,p] for which a1x+b1,…,asx+bs(modp) all l...
Multiplicative inverse is a crucial operation in cryptographic systems; public key cryptography has ...
In this paper, we define the Fibonacci-Fibonacci p-sequence and then we discuss the connection of th...
Abstract. For a fixed prime p, the maximum coefficient (in absolute value) M(p) of the cyclotomic po...
peer reviewedThis article starts a computational study of congruences of modular forms and modular G...
We establish a q-analogue of the congruence (papb)≡(ab) (modp2) where p is a prime and a and b are...
Includes bibliographical references.This paper treats the cycles formed by the residues of different...
We briefly discuss a congruence relation of the subsequence of the Fibonacci m-step numbers. Then we...
An inverse theorem mod p by Yahya Ould Hamidoune (Paris) and Øystein J. Rødseth (Bergen) 1. Introduc...
We consider new kinds of max and min matrices, [amax(i,j)]i,j?1 and [amin(i,j)]i,j?1, as generalizat...
[[abstract]]In 1997, Calvez, Azou, and Vilbé proposed a variation on Euclidean algorithm, which can ...