# coincidence

Coincidence algorithm

## Description

returns the scalar `x`

= coincidence(`res`

,`div`

,`maxval`

)`x`

that is less than or equal to
`maxval`

and is congruent to each remainder in `res`

for the corresponding divisor in `div`

. `x`

satisfies

mod(`x`

,`div`

) =
`res`

.

In other words, dividing `x`

by each element of
`div`

leaves as remainder the corresponding element of
`res`

.

also specifies the tolerance. In practice, there may be no value that satisfies all
constraints in `x`

= coincidence(`res`

,`div`

,`maxval`

,`tol`

)`res`

and `div`

exactly. In that case,
`coincidence`

identifies a set of candidates that approximately satisfy
the constraints and are within an interval of width 2 × `tol`

centered at the candidates' median. The function then returns the median
as `x`

.

## Examples

## Input Arguments

## Output Arguments

## Extended Capabilities

## Version History

**Introduced in R2021a**