special_factorization_identity.sf 1.1 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849
  1. #!/usr/bin/ruby
  2. # Daniel "Trizen" Suteu
  3. # Date: 09 August 2019
  4. # https://github.com/trizen
  5. # A new special factorization identity for:
  6. #
  7. # a(n) = (2^f(n) - f(n) + 1) * 2^f(n) + 1
  8. #
  9. # where: f(n) = 4*n*(n+1).
  10. # The sequence a(n) can be factorized as:
  11. #
  12. # a(n) = (x - y - z + 1)(x + y + z + 1)
  13. #
  14. # where: x = 2^f(n)
  15. # y = 2^(f(n)/2)
  16. # z = n * 2^(f(n)/2 + 1)
  17. func f(n) { 4 * n * (n+1) }
  18. func a(n) {
  19. (2**f(n) - f(n) + 1) * 2**f(n) + 1
  20. }
  21. func factors_of_a(n) {
  22. var x = 2**f(n)
  23. var y = 2**(f(n)/2)
  24. var z = n*(2**(f(n)/2 + 1))
  25. [(x - y - z + 1), (x + y + z + 1)]
  26. }
  27. for n in (1..5) {
  28. var u = a(n)
  29. var t = factors_of_a(n)
  30. say "#{u} = #{t.join(' * ')}"
  31. assert_eq(u, t.prod)
  32. }
  33. __END__
  34. 63745 = 209 * 305
  35. 281474590834689 = 16756737 * 16797697
  36. 79228162514251108269638549505 = 281474859270145 * 281475094151169
  37. 1461501637330902918203589327576533463951130755073 = 1208925819604733570056193 * 1208925819624524779356161
  38. 1766847064778384329583297500742918357649352398470630082568566027931615233 = 1329227995784915860221670509605027841 * 1329227995784915885585943610955661313