λ(n)-Parameter Families

1969 ◽  
Vol 12 (2) ◽  
pp. 185-191 ◽  
Author(s):  
Ronald M. Mathsen
Keyword(s):  
Positive Integer ◽  
Real Numbers ◽  
Positive Integers

I is an interval of R, the set of real numbers, n is a positive integer and F ⊂ Cj (I) for j ≥ 0 large enough so that the following definitions are possible:(i) Let λ(n) = (λ1, λ2,…,λk) where k, λ1, λ2,…, λk, are positive integers and λ1 + λ2 +… +λk = n. Then λ(n) is an ordered partition of n. The set of all such partitions of n is denoted by P(n).

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 On simultaneous rational approximation to a p-adic number and its integral powers

2011 ◽  
Vol 54 (3) ◽  
pp. 599-612 ◽  
Author(s):  
Yann Bugeaud ◽  
Natalia Budarina ◽  
Detta Dickinson ◽  
Hugh O'Donnell
Keyword(s):  
Positive Integer ◽  
Prime Number ◽  
Rational Approximation ◽  
Real Numbers ◽  
The Real ◽  
Positive Integers ◽  
Simultaneous Rational Approximation

AbstractLet p be a prime number. For a positive integer n and a p-adic number ξ, let λn(ξ) denote the supremum of the real numbers λ such that there are arbitrarily large positive integers q such that ‖qξ‖p,‖qξ2‖p,…,‖qξn‖p are all less than q−λ−1. Here, ‖x‖p denotes the infimum of |x−n|p as n runs through the integers. We study the set of values taken by the function λ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].

Analogue of a theorem of Khintchine in fields of formal power series

1966 ◽  
Vol 62 (4) ◽  
pp. 637-642 ◽  
Author(s):  
T. W. Cusick
Keyword(s):  
Power Series ◽  
Positive Constant ◽  
Classical Result ◽  
Real Numbers ◽  
Linear Forms ◽  
Absolute Value ◽  
The Difference ◽  
Image Position ◽  
Formal Power ◽  
Positive Integers

For a real number λ, ‖λ‖ is the absolute value of the difference between λ and the nearest integer. Let X represent the m-tuple (x1, x2, … xm) and letbe any n linear forms in m variables, where the Θij are real numbers. The following is a classical result of Khintchine (1):For all pairs of positive integers m, n there is a positive constant Г(m, n) with the property that for any forms Lj(X) there exist real numbers α1, α2, …, αn such thatfor all integers x1, x2, …, xm not all zero.

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 Oscillation Conditions for Difference Equations with a Monotone or Nonmonotone Argument

2018 ◽  
Vol 2018 ◽  
pp. 1-13 ◽  
Author(s):  
G. M. Moremedi ◽  
I. P. Stavroulakis
Keyword(s):  
Positive Integer ◽  
Difference Equation ◽  
Difference Equations ◽  
Delay Difference Equation ◽  
Real Numbers ◽  
First Order ◽  
All Solutions ◽  
Delay Difference ◽  
Constant Argument

Consider the first-order delay difference equation with a constant argument Δxn+pnxn-k=0,  n=0,1,2,…, and the delay difference equation with a variable argument Δxn+pnxτn=0,  n=0,1,2,…, where p(n) is a sequence of nonnegative real numbers, k is a positive integer, Δx(n)=x(n+1)-x(n), and τ(n) is a sequence of integers such that τ(n)≤n-1 for all n≥0 and limn→∞τ(n)=∞. A survey on the oscillation of all solutions to these equations is presented. Examples illustrating the results are 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