## Partition Of The Primorial Square By Remainder Agreement Counts

**Authors:** Sally Myers Moite

For the n-th prime P, P# or P primorial is the product of all the primes up to and including P. Let (c, d) be a pair of integers that represents a point in the primorial square, 1 < c, d < P#. For each prime p, 2 < p < P, the remainders of c and d mod p may be the same, opposite (sum to a multiple of p) or neither. Count the number of remainders of (c, d) which have same, opposite or either agreement for any such P. This gives three partitions of the primorial square, by counts for same, opposite and either agreement. Polynomial multiplication is used to find the number of points in each part of these partitions.

**Comments:** 8 Pages.

**Download:** **PDF**

### Submission history

[v1] 2019-06-05 23:59:34

**Unique-IP document downloads:** 6 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary.
In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution.
Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

**Add your own feedback and questions here:**

*You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.*

*
*