JildertD

Untitled

Oct 4th, 2016
45
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.09 KB | None | 0 0
  1. Take any number x (x>1), with p sets of consecutive integers with k elements adding up to x.
  2. Note: for every k there is only one p
  3.  
  4. If you multiply any even x by 2 (or 2^n), p raises with the amount of uneven divisors of x.
  5.  
  6. This is because, as partly shown in the solution for the number 2016, in all situations:
  7. 1) consider k uneven, the set has an average value of x/k, being an integer. Multiplying a number by 2^n doesn't give it more (or less) possibilities of multiplying prime factors and getting an uneven number.
  8. 2) consider k even. x/k has to be a/2, with a an integer. Thus, to have an even amount of numbers in any p x has to be uneven. So, if x is already even and you multiply it by 2, you don't increase nor decrease the amount of values of k with k being even.
  9.  
  10. Conclusion: if the prime factorisation of x is 2^m*... with m>1, you can divide it by 2 without changing p.
  11.  
  12. Since 294912 = 2^15 * 3^2, 294912 has the same value for p as 2 * 3^2 = 18.
  13. If we divide 18 by all integers lower than sqrt(18) (1, 2, 3 and 4), we'll see that k can only be 1 or 3. (fyi: {294912} and {98303,98304,98305}
Add Comment
Please, Sign In to add comment