Corpus ID: 204901382

A Curious Link Between Prime Numbers, the Maundy Cake Problem and Parallel Sorting

@article{Blanchette2019ACL,
  title={A Curious Link Between Prime Numbers, the Maundy Cake Problem and Parallel Sorting},
  author={J. Blanchette and R. Lagani{\`e}re},
  journal={ArXiv},
  year={2019},
  volume={abs/1910.11749}
}
  • J. Blanchette, R. Laganière
  • Published 2019
  • Computer Science, Mathematics
  • ArXiv
  • We present new theoretical algorithms that sums the n-ary comparators output in order to get the permutation indices in order to sort a sequence. By analysing the parallel ranking algorithm, we found that the special comparators number of elements it processes divide the number of elements to be sorted. Using the divide and conquer method, we can express the sorting problem into summing output of comparators taking a prime number of elements, given that this prime number divides the initial… CONTINUE READING

    Figures, Tables, and Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    References

    Publications referenced by this paper.
    The Proof is in the Pudding: The Changing Nature of Mathematical Proof
    • 17
    • PDF