scholarly journals On a Generalization of a Lucas’ Result and an Application to the 4-Pascal’s Triangle

Symmetry ◽  
2020 ◽  
Vol 12 (2) ◽  
pp. 288
Author(s):  
Atsushi Yamagami ◽  
Kazuki Taniguchi
Keyword(s):  
Number Theory ◽  
Positive Integer ◽  
Prime Number ◽  
Special Issue ◽  
Pascal’S Triangle ◽  
Mersenne Number ◽  
Modulo P ◽  
Pascal's Triangle ◽  
Positive Integers ◽  
Symmetric Property

The Pascal’s triangle is generalized to “the k-Pascal’s triangle” with any integer k ≥ 2 . Let p be any prime number. In this article, we prove that for any positive integers n and e, the n-th row in the p e -Pascal’s triangle consists of integers which are congruent to 1 modulo p if and only if n is of the form p e m − 1 p e − 1 with some integer m ≥ 1 . This is a generalization of a Lucas’ result asserting that the n-th row in the (2-)Pascal’s triangle consists of odd integers if and only if n is a Mersenne number. As an application, we then see that there exists no row in the 4-Pascal’s triangle consisting of integers which are congruent to 1 modulo 4 except the first row. In this application, we use the congruence ( x + 1 ) p e ≡ ( x p + 1 ) p e − 1 ( mod p e ) of binomial expansions which we could prove for any prime number p and any positive integer e. We think that this article is fit for the Special Issue “Number Theory and Symmetry,” since we prove a symmetric property on the 4-Pascal’s triangle by means of a number-theoretical property of binomial expansions.

A SURVEY OF FACTORIZATION COUNTING FUNCTIONS

2005 ◽  
Vol 01 (04) ◽  
pp. 563-581 ◽  
Author(s):  
A. KNOPFMACHER ◽  
M. E. MAYS
Keyword(s):  
Number Theory ◽  
Positive Integer ◽  
Additive Number Theory ◽  
Recursive Algorithms ◽  
Additive Number ◽  
Combinatorial Objects ◽  
Survey Techniques ◽  
Counting Functions ◽  
General Field ◽  
Positive Integers

The general field of additive number theory considers questions concerning representations of a given positive integer n as a sum of other integers. In particular, partitions treat the sums as unordered combinatorial objects, and compositions treat the sums as ordered. Sometimes the sums are restricted, so that, for example, the summands are distinct, or relatively prime, or all congruent to ±1 modulo 5. In this paper we review work on analogous problems concerning representations of n as a product of positive integers. We survey techniques for enumerating product representations both in the unrestricted case and in the case when the factors are required to be distinct, and both when the product representations are considered as ordered objects and when they are unordered. We offer some new identities and observations for these and related counting functions and derive some new recursive algorithms to generate lists of factorizations with restrictions of various types.

scholarly journals A Ramsey-type property in additive number theory

1985 ◽  
Vol 27 ◽  
pp. 5-10
Author(s):  
S. A. Burr ◽  
P. Erdös
Keyword(s):  
Number Theory ◽  
Positive Integer ◽  
Additive Number Theory ◽  
Additive Number ◽  
Large Positive Integer ◽  
Ramsey Type ◽  
Type Property ◽  
Positive Integers

Let A be a sequence of positive integers. Define P(A) to be the set of all integers representable as a sum of distinct terms of A. Note that if A contains a repeated value, we are free to use it as many times as it occurs in A. We call A complete if every sufficiently large positive integer is in P(A), and entirely complete if every positive integer is in P(A). Completeness properties have received considerable, if somewhat sporadic, attention over the years. See Chapter 6 of [3] for a survey.

scholarly journals Further Results on a Curious Arithmetic Function

2020 ◽  
Vol 2020 ◽  
pp. 1-7
Author(s):  
Long Chen ◽  
Kaimin Cheng ◽  
Tingting Wang
Keyword(s):  
Positive Integer ◽  
Prime Number ◽  
Arithmetic Function ◽  
Rational Numbers ◽  
Arithmetic Properties ◽  
Adic Valuation ◽  
Positive Integers

Let p be an odd prime number and n be a positive integer. Let vpn, N∗, and Q+ denote the p-adic valuation of the integer n, the set of positive integers, and the set of positive rational numbers, respectively. In this paper, we introduce an arithmetic function fp:N∗⟶Q+ defined by fpn≔n/pvpn1−vpn for any positive integer n. We show several interesting arithmetic properties about that function and then use them to establish some curious results involving the p-adic valuation. Some of these results extend Farhi’s results from the case of even prime to that of odd prime.

NOTE ON LEHMER–PIERCE SEQUENCES WITH THE SAME PRIME DIVISORS

2017 ◽  
Vol 97 (1) ◽  
pp. 11-14
Author(s):  
M. SKAŁBA
Keyword(s):  
Positive Integer ◽  
Prime Number ◽  
Prime Divisors ◽  
Positive Integers

Let $a_{1},a_{2},\ldots ,a_{m}$ and $b_{1},b_{2},\ldots ,b_{l}$ be two sequences of pairwise distinct positive integers greater than $1$. Assume also that none of the above numbers is a perfect power. If for each positive integer $n$ and prime number $p$ the number $\prod _{i=1}^{m}(1-a_{i}^{n})$ is divisible by $p$ if and only if the number $\prod _{j=1}^{l}(1-b_{j}^{n})$ is divisible by $p$, then $m=l$ and $\{a_{1},a_{2},\ldots ,a_{m}\}=\{b_{1},b_{2},\ldots ,b_{l}\}$.

Pascal's Triangle— a Serendipitous Source for Programming Activities

1983 ◽  
Vol 76 (9) ◽  
pp. 686-690
Author(s):  
Marita Eng ◽  
John Casey
Keyword(s):  
Number Theory ◽  
Computer Programming ◽  
Pascal’S Triangle ◽  
Pascal's Triangle

Pascal's triangle is an elegant array of numbers that has fascinated mathematicians since its invention. Its applications in algebra, number theory, and probability are well known. The use of Pascal's triangle in the classroom need not be restricted to these conventionally accepted applications. Explorations of Pascal's triangle through the use of computer programming create situations that are incredibly rich in their mathematical yield.

RECURRENT TWO-DIMENSIONAL SEQUENCES GENERATED BY HOMOMORPHISMS OF FINITE ABELIAN p-GROUPS WITH PERIODIC INITIAL CONDITIONS

Fractals ◽  
2011 ◽  
Vol 19 (04) ◽  
pp. 431-442 ◽  
Author(s):  
MIHAI PRUNESCU
Keyword(s):  
Initial Conditions ◽  
Two Dimensional ◽  
Pascal’S Triangle ◽  
Modulo P ◽  
Pascal's Triangle ◽  
Context Free

We prove that if a recurrent two-dimensional sequence with periodic initial conditions coincides in a sufficiently large starting square with a two-dimensional sequence produced by an expansive system of context-free substitutions, then they must coincide everywhere. We apply this result for some examples built up by homomorphisms of finite abelian p-groups, in particular for Pascal's Triangle modulo pk, Pascal's Triangles modulo 2 with non-trivial periodic borders, and Sierpinski's Carpets with non-trivial periodic border. All these particular cases justify the conjecture that recurrent two-dimensional sequences generated by homomorphisms of finite abelian p-groups with periodic initial conditions can always be alternatively generated by expansive systems of context-free substitutions.

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 A note on the polynomial-exponential Diophantine equation (a^n − 1)(b^n − 1) = x^2

2021 ◽  
Vol 27 (3) ◽  
pp. 123-129
Author(s):  
Yasutsugu Fujita ◽  
◽  
Maohua Le ◽  
Keyword(s):  
Number Theory ◽  
Positive Integer ◽  
Diophantine Equation ◽  
Exponential Diophantine Equation ◽  
Elementary Number Theory ◽  
Elementary Number ◽  
Integer Solutions ◽  
Positive Integers

For any positive integer t, let ord_2 t denote the order of 2 in the factorization of t. Let a,\,b be two distinct fixed positive integers with \min\{a,b\}>1. In this paper, using some elementary number theory methods, the existence of positive integer solutions (x,n) of the polynomial-exponential Diophantine equation (*) (a^n-1)(b^n-1)=x^2 with n>2 is discussed. We prove that if \{a,b\}\ne \{13,239\} and ord_2(a^2-1)\ne ord_2(b^2-1), then (*) has no solutions (x,n) with 2\mid n. Thus it can be seen that if \{a,b\}\equiv \{3,7\},\{3,15\},\{7,11\},\{7,15\} or \{11,15\} \pmod{16}, where \{a,b\} \equiv \{a_0,b_0\} \pmod{16} means either a \equiv a_0 \pmod{16} and b \equiv b_0\pmod{16} or a\equiv b_0 \pmod{16} and b\equiv a_0 \pmod{16}, then (*) has no solutions (x,n).

Notes on Number Theory II : On a theorem of van der Waerden

1960 ◽  
Vol 3 (1) ◽  
pp. 23-25 ◽  
Author(s):  
Leo Moser
Keyword(s):  
Number Theory ◽  
Positive Integer ◽  
Arithmetic Progression ◽  
Positive Integers

A well known theorem of van der Waerden [1] states that given any two positive integers k and t, there exists a positive integer m such that in every distribution of the numbers 1,2, …, m into k classes, at least one class contains an arithmetic progression of t + 1 terms. Other proofs and generalizations of this theorem have been given by Griinwald [2], Witt [3] and Lukomskaya [4]. The last mentioned proof appears in the booklet of Khinchin “Three pearls of number theory” in which van der Waerden's theorem plays the role of the first pearl.

scholarly journals On Pascal's triangle modulo $p^2$

1997 ◽  
Vol 74 (1) ◽  
pp. 157-165
Author(s):  
James Huard ◽  
Blair Spearman ◽  
Kenneth Williams
Keyword(s):  
Pascal’S Triangle ◽  
Modulo P ◽  
Pascal's Triangle
Sign in / Sign up

Export Citation Format

Share Document