Algorithms for Solving Some Inverse Problems from Combinatorial Number Theory

2017 ◽  
Vol 20 (2) ◽  
pp. 1-8
Author(s):  
Elias Abboud
Keyword(s):  
Number Theory ◽  
Inverse Problems ◽  
Combinatorial Number Theory

Arbeitsgemeinschaft: Ergodic Theory and Combinatorial Number Theory

2012 ◽  
Vol 9 (4) ◽  
pp. 2985-3059
Author(s):  
Vitaly Bergelson ◽  
Nikos Frantzikinakis ◽  
Terence Tao ◽  
Tamar Ziegler
Keyword(s):  
Number Theory ◽  
Ergodic Theory ◽  
Combinatorial Number Theory

Some nonstandard methods in combinatorial number theory

Studia Logica ◽  
1988 ◽  
Vol 47 (3) ◽  
pp. 265-278 ◽  
Author(s):  
Steven C. Leth
Keyword(s):  
Number Theory ◽  
Combinatorial Number Theory

scholarly journals A variance method in combinatorial number theory

1969 ◽  
Vol 10 (2) ◽  
pp. 126-129 ◽  
Author(s):  
Ian Anderson
Keyword(s):  
Number Theory ◽  
Variance Method ◽  
Combinatorial Number Theory ◽  
Prime Factors ◽  
Integer Solutions ◽  
Image Position ◽  
Positive Integers

Let s = s(a1, a2,...., ar) denote the number of integer solutions of the equationsubject to the conditionsthe ai being given positive integers, and square brackets denoting the integral part. Clearly s (a1,..., ar) is also the number s = s(m) of divisors of which contain exactly λ prime factors counted according to multiplicity, and is therefore, as is proved in [1], the cardinality of the largest possible set of divisors of m, no one of which divides another.

Sign in / Sign up

Export Citation Format

Share Document