DEFINING POWER SUMS OF n AND φ(n) INTEGERS

2009 ◽  
Vol 05 (01) ◽  
pp. 41-53 ◽  
Author(s):  
JITENDER SINGH
Keyword(s):  
Positive Integer ◽  
Closed Form ◽  
Power Sums ◽  
Power Sum ◽  
Analytical Results ◽  
General Power ◽  
Integral Relations ◽  
Positive Integers

Let n be a positive integer and φ(n) denotes the Euler phi function. It is well known that the power sum of n can be evaluated in closed form in terms of n. Also, the sum of all those φ(n) positive integers that are coprime to n and not exceeding n, is expressible in terms of n and φ(n). Although such results already exist in literature, but here we have presented some new analytical results in these connections. Some functional and integral relations are derived for the general power sums.

scholarly journals Sums of Products Involving Power Sums of φ(n) Integers

2014 ◽  
Vol 2014 ◽  
pp. 1-6
Author(s):  
Jitender Singh
Keyword(s):  
Closed Form ◽  
Complex Variable ◽  
Bernoulli Polynomials ◽  
Rational Numbers ◽  
Bernoulli Numbers ◽  
Higher Order ◽  
Power Sums ◽  
Power Sum ◽  
Mobius Function ◽  
Sums Of Products

A sequence of rational numbers as a generalization of the sequence of Bernoulli numbers is introduced. Sums of products involving the terms of this generalized sequence are then obtained using an application of Faà di Bruno's formula. These sums of products are analogous to the higher order Bernoulli numbers and are used to develop the closed form expressions for the sums of products involving the power sums Ψk(x,n):=∑d|n‍μ(d)dkSkx/d,  n∈ℤ+ which are defined via the Möbius function μ and the usual power sum Sk(x) of a real or complex variable x. The power sum Sk(x) is expressible in terms of the well-known Bernoulli polynomials by Sk(x):=(Bk+1(x+1)-Bk+1(1))/(k+1).

scholarly journals An Identity in Commutative Rings with Unity with Applications to Various Sums of Powers

2017 ◽  
Vol 2017 ◽  
pp. 1-7
Author(s):  
Miomir Andjić ◽  
Romeo Meštrović
Keyword(s):  
Positive Integer ◽  
Commutative Ring ◽  
Commutative Rings ◽  
Power Sum ◽  
Sums Of Powers ◽  
Symmetric Set ◽  
Positive Integers

Let R=(R,+,·) be a commutative ring of characteristic m>0 (m may be equal to +∞) with unity e and zero 0. Given a positive integer n<m and the so-called n-symmetric set A=a1,a2,…,a2l-1,a2l such that al+i=ne-ai for each i=1,…,l, define the rth power sum Sr(A) as Sr(A)=∑i=12lair, for r=0,1,2,…. We prove that for each positive integer k there holds ∑i=02k-1(-1)i2k-1i22k-1-iniS2k-1-i(A)=0. As an application, we obtain two new Pascal-like identities for the sums of powers of the first n-1 positive integers.

scholarly journals Some Addition Formulas for Fibonacci, Pell and Jacobsthal Numbers

2019 ◽  
Vol 33 (1) ◽  
pp. 55-65
Author(s):  
Göksal Bilgici ◽  
Tuncay Deniz Şentürk
Keyword(s):  
Positive Integer ◽  
Closed Form ◽  
Arbitrary Positive Integer ◽  
Open Problems ◽  
Positive Integers ◽  
Addition Formulas

AbstractIn this paper, we obtain a closed form for ${F_{\sum\nolimits_{i = 1}^k {} }}$, ${P_{\sum\nolimits_{i = 1}^k {} }}$and ${J_{\sum\nolimits_{i = 1}^k {} }}$ for some positive integers k where Fr, Pr and Jr are the rth Fibonacci, Pell and Jacobsthal numbers, respectively. We also give three open problems for the general cases ${F_{\sum\nolimits_{i = 1}^n {} }}$, ${P_{\sum\nolimits_{i = 1}^n {} }}$ and ${J_{\sum\nolimits_{i = 1}^n {} }}$for any arbitrary positive integer n.

scholarly journals On the Ternary Exponential Diophantine Equation Equating a Perfect Power and Sum of Products of Consecutive Integers

Mathematics ◽  
2021 ◽  
Vol 9 (15) ◽  
pp. 1813
Author(s):  
S. Subburam ◽  
Lewis Nkenyereye ◽  
N. Anbazhagan ◽  
S. Amutha ◽  
M. Kameswari ◽  
...  
Keyword(s):  
Positive Integer ◽  
Diophantine Equation ◽  
Upper Bound ◽  
Exponential Diophantine Equation ◽  
Research Article ◽  
All Solutions ◽  
Sum Of Products ◽  
Consecutive Integers ◽  
Sums Of Products ◽  
Positive Integers

Consider the Diophantine equation yn=x+x(x+1)+⋯+x(x+1)⋯(x+k), where x, y, n, and k are integers. In 2016, a research article, entitled – ’power values of sums of products of consecutive integers’, primarily proved the inequality n= 19,736 to obtain all solutions (x,y,n) of the equation for the fixed positive integers k≤10. In this paper, we improve the bound as n≤ 10,000 for the same case k≤10, and for any fixed general positive integer k, we give an upper bound depending only on k for n.

Congruences involving alternating harmonic sums modulo pα qβ

2018 ◽  
Vol 68 (5) ◽  
pp. 975-980
Author(s):  
Zhongyan Shen ◽  
Tianxin Cai
Keyword(s):  
Positive Integer ◽  
Positive Integers ◽  
Mod P

Abstract In 2014, Wang and Cai established the following harmonic congruence for any odd prime p and positive integer r, $$\sum_{\begin{subarray}{c}i+j+k=p^{r}\\ i,j,k\in\mathcal{P}_{p}\end{subarray}}\frac{1}{ijk}\equiv-2p^{r-1}B_{p-3} \quad\quad(\text{mod} \,\, {p^{r}}),$$ where $ \mathcal{P}_{n} $ denote the set of positive integers which are prime to n. In this note, we obtain the congruences for distinct odd primes p, q and positive integers α, β, $$ \sum_{\begin{subarray}{c}i+j+k=p^{\alpha}q^{\beta}\\ i,j,k\in\mathcal{P}_{2pq}\end{subarray}}\frac{1}{ijk}\equiv\frac{7}{8}\left(2-% q\right)\left(1-\frac{1}{q^{3}}\right)p^{\alpha-1}q^{\beta-1}B_{p-3}\pmod{p^{% \alpha}} $$ and $$ \sum_{\begin{subarray}{c}i+j+k=p^{\alpha}q^{\beta}\\ i,j,k\in\mathcal{P}_{pq}\end{subarray}}\frac{(-1)^{i}}{ijk}\equiv\frac{1}{2}% \left(q-2\right)\left(1-\frac{1}{q^{3}}\right)p^{\alpha-1}q^{\beta-1}B_{p-3}% \pmod{p^{\alpha}}. $$

scholarly journals Partitioning the positive integers with higher order recurrences

1991 ◽  
Vol 14 (3) ◽  
pp. 457-462 ◽  
Author(s):  
Clark Kimberling
Keyword(s):  
Positive Integer ◽  
Positive Root ◽  
Irrational Number ◽  
Higher Order ◽  
Typical Result ◽  
Algebraic Integers ◽  
Positive Integers

Associated with any irrational numberα>1and the functiong(n)=[αn+12]is an array{s(i,j)}of positive integers defined inductively as follows:s(1,1)=1,s(1,j)=g(s(1,j−1))for allj≥2,s(i,1)=the least positive integer not amongs(h,j)forh≤i−1fori≥2, ands(i,j)=g(s(i,j−1))forj≥2. This work considers algebraic integersαof degree≥3for which the rows of the arrays(i,j)partition the set of positive integers. Such an array is called a Stolarsky array. A typical result is the following (Corollary 2): ifαis the positive root ofxk−xk−1−…−x−1fork≥3, thens(i,j)is a Stolarsky array.

scholarly journals The Divisibility of Divisor Functions

1961 ◽  
Vol 5 (1) ◽  
pp. 35-40 ◽  
Author(s):  
R. A. Rankin
Keyword(s):  
Positive Integer ◽  
Divisor Functions ◽  
Image Position ◽  
Positive Integers

For any positive integers n and v letwhere d runs through all the positive divisors of n. For each positive integer k and real x > 1, denote by N(v, k; x) the number of positive integers n ≦ x for which σv(n) is not divisible by k. Then Watson [6] has shown that, when v is odd,as x → ∞; it is assumed here and throughout that v and k are fixed and independent of x. It follows, in particular, that σ (n) is almost always divisible by k. A brief account of the ideas used by Watson will be found in § 10.6 of Hardy's book on Ramanujan [2].

scholarly journals Solution of certain Pell equations

2018 ◽  
Vol 11 (04) ◽  
pp. 1850056 ◽  
Author(s):  
Zahid Raza ◽  
Hafsa Masood Malik
Keyword(s):  
Positive Integer ◽  
Fundamental Solution ◽  
Positive Solutions ◽  
Continued Fraction ◽  
Pell Equation ◽  
Lucas Sequences ◽  
Pell Equations ◽  
Integer Solutions ◽  
Positive Integers

Let [Formula: see text] be any positive integers such that [Formula: see text] and [Formula: see text] is a square free positive integer of the form [Formula: see text] where [Formula: see text] and [Formula: see text] The main focus of this paper is to find the fundamental solution of the equation [Formula: see text] with the help of the continued fraction of [Formula: see text] We also obtain all the positive solutions of the equations [Formula: see text] and [Formula: see text] by means of the Fibonacci and Lucas sequences.Furthermore, in this work, we derive some algebraic relations on the Pell form [Formula: see text] including cycle, proper cycle, reduction and proper automorphism of it. We also determine the integer solutions of the Pell equation [Formula: see text] in terms of [Formula: see text] We extend all the results of the papers [3, 10, 27, 37].

scholarly journals ON INTEGER SEQUENCES GENERATED BY LINEAR MAPS

2009 ◽  
Vol 51 (2) ◽  
pp. 243-252
Author(s):  
ARTŪRAS DUBICKAS
Keyword(s):  
Lower Bound ◽  
Positive Integer ◽  
Real Number ◽  
Constant Independent ◽  
Integer Sequences ◽  
Real Numbers ◽  
Complexity Function ◽  
Linear Maps ◽  
Coprime Integers ◽  
Positive Integers

AbstractLetx0<x1<x2< ⋅⋅⋅ be an increasing sequence of positive integers given by the formulaxn=⌊βxn−1+ γ⌋ forn=1, 2, 3, . . ., where β > 1 and γ are real numbers andx0is a positive integer. We describe the conditions on integersbd, . . .,b0, not all zero, and on a real number β > 1 under which the sequence of integerswn=bdxn+d+ ⋅⋅⋅ +b0xn,n=0, 1, 2, . . ., is bounded by a constant independent ofn. The conditions under which this sequence can be ultimately periodic are also described. Finally, we prove a lower bound on the complexity function of the sequenceqxn+1−pxn∈ {0, 1, . . .,q−1},n=0, 1, 2, . . ., wherex0is a positive integer,p>q> 1 are coprime integers andxn=⌈pxn−1/q⌉ forn=1, 2, 3, . . . A similar speculative result concerning the complexity of the sequence of alternatives (F:x↦x/2 orS:x↦(3x+1)/2) in the 3x+1 problem is also given.

scholarly journals Characterizations and Identities for Isosceles Triangular Numbers

2021 ◽  
Vol 14 (2) ◽  
pp. 380-395
Author(s):  
Jiramate Punpim ◽  
Somphong Jitman
Keyword(s):  
Positive Integer ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Triangular Numbers ◽  
Triangular Number ◽  
Recursive Formulas ◽  
Necessary And Sufficient ◽  
Positive Integers ◽  
Special Case

Triangular numbers have been of interest and continuously studied due to their beautiful representations, nice properties, and various links with other figurate numbers. For positive integers n and l, the nth l-isosceles triangular number is a generalization of triangular numbers defined to be the arithmetic sum of the formT(n, l) = 1 + (1 + l) + (1 + 2l) + · · · + (1 + (n − 1)l).In this paper, we focus on characterizations and identities for isosceles triangular numbers as well as their links with other figurate numbers. Recursive formulas for constructions of isosceles triangular numbers are given together with necessary and sufficient conditions for a positive integer to be a sum of isosceles triangular  numbers. Various identities for isosceles triangular numbers are established. Results on triangular numbers can be viewed as a special case.

Sign in / Sign up

Export Citation Format

Share Document