• Title/Summary/Keyword: sum of power of integers

Search Result 4, Processing Time 0.016 seconds

On the Historical investigation of Sums of Power of Consecutive Integer (연속된 정수의 멱의 합의 변천사에 대한 고찰)

  • Kang Dong-Jin;Kim Dae-Yeoul;Park Dal-Won;Seo Jong-Jin;Rim Seog-Hoo;Jang Lee-Chae
    • Journal for History of Mathematics
    • /
    • v.19 no.1
    • /
    • pp.1-16
    • /
    • 2006
  • In 1713, J. Bernoulli first discovered the method which one can produce those formulae for the sum $\sum\limits_{\iota=1}^{n}\;\iota^k$ for any natural numbers k ([5],[6]). In this paper, we investigate for the historical background and motivation of the sums of powers of consecutive integers due to J. Bernoulli. Finally, we introduce and discuss for the subjects which are studying related to these areas in the recent.

  • PDF

GENERALIZATIONS OF NUMBER-THEORETIC SUMS

  • Kanasri, Narakorn Rompurk;Pornsurat, Patchara;Tongron, Yanapat
    • Communications of the Korean Mathematical Society
    • /
    • v.34 no.4
    • /
    • pp.1105-1115
    • /
    • 2019
  • For positive integers n and k, let $S_k(n)$ and $S^{\prime}_k(n)$ be the sums of the elements in the finite sets {$x^k:1{\leq}x{\leq}n$, (x, n) = 1} and {$x^k:1{\leq}x{\leq}n/2$, (x, n) = 1}respectively. The formulae for both $S_k(n)$ and $S^{\prime}_k(n)$ are established. The explicit formulae when k = 1, 2, 3 are also given.

ON PILLAI'S PROBLEM WITH TRIBONACCI NUMBERS AND POWERS OF 2

  • Bravo, Jhon J.;Luca, Florian;Yazan, Karina
    • Bulletin of the Korean Mathematical Society
    • /
    • v.54 no.3
    • /
    • pp.1069-1080
    • /
    • 2017
  • The Tribonacci sequence ${\{T_n}\}_{n{\geq}0}$ resembles the Fibonacci sequence in that it starts with the values 0, 1, 1, and each term afterwards is the sum of the preceding three terms. In this paper, we find all integers c having at least two representations as a difference between a Tribonacci number and a power of 2. This paper continues the previous work [5].

An Easy Way to Derive the Fourier Transforms of the Truncated Raised-Cosine Function and the n-th Order Powers of it Using Partial-Response System Concept : A Recursive Formula (상승 Cosine 함수와 그 n-제곱 함수의 Fourier 변환을 구하기 위한 용이한 방법: 부분 응답 시스 템 개념을 이용한 순환 공식)

  • 오용선;강창언
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.17 no.1
    • /
    • pp.29-37
    • /
    • 1992
  • In this paper, a new and easy analytical method to get the Fourier transforms of a popular type of truncated raised cosine function and its powers (n=1, 2, :1‥‥ : positive integers) Is proposed. This new. method is based on the concept of the ( 1+D)_type partial response system, and the procedure is more compact than the conventional method using differentiations. Especially, the results are obtained as a sum of three functions which are easily manageable for each power And they are recursively related to their powers. Therefore, they can be excellently applied to the computer-aided numerical solutions.

  • PDF