Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

A formula for constructing Mignotte sequences

Marek Putresza

Abstract

This article present a new, direct and simple formula for constructing Mignotte sequences.

A formula for constructing Mignotte sequences

Abstract

This article present a new, direct and simple formula for constructing Mignotte sequences.

Paper Structure

This paper contains 1 section, 1 theorem, 32 equations.

Table of Contents

  1. Acknowledgements

Key Result

Theorem 1

Let $q_1,\ldots,q_n$, $n\geq3$, be an increasing sequence of pairwise relatively prime positive integers. Define: Then is a $(k,n)$-Mignotte sequence for any $1<k<n$.

Theorems & Definitions (4)

  • Theorem 1
  • proof : Proof
  • Remark 2
  • Remark 3