A Nice Constructive Problem.

Revision en3, by void.abyss, 2019-07-14 09:13:12
  1. You have to make an array of n elements where the summation of any SUBARRAY won't be divisible by m (n > m). Is it possible? If not then proof?
  2. You have to make an array of n elements where the summation of any SUBSET won't be divisible by m (n > m). Is it possible? If not then proof? for simplicity: 1 <= n, m <= 100000
Tags #constructive algorithms, #math

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en3 English void.abyss 2019-07-14 09:13:12 0 (published)
en2 English void.abyss 2019-07-14 09:12:56 12 (saved to drafts)
en1 English void.abyss 2019-07-14 09:10:06 351 Initial revision (published)