The Divisor Problem for ( K, R) — Integers

Journal of the Australian Mathematical Society
doi 10.1017/s1446788700028792
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Cambridge University Press (CUP)

Related search

Sublinear Parallel Algorithm for Computing the Greatest Common Divisor of Two Integers

SIAM Journal on Computing
MathematicsComputer Science
1987English

The Trace Problem for Totally Positive Algebraic Integers

Journal of the Australian Mathematical Society
Mathematics
2011English

On the Theta Divisor of SU(r; 1)

Nagoya Mathematical Journal
Mathematics
2002English

On the Unbiasedness of the Parametric Divisor Method for the Apportionment Problem

Journal of the Operations Research Society of Japan
Management ScienceDecision SciencesOperations Research
1995English

On Some Analogues of Titchmarsh Divisor Problem

Nagoya Mathematical Journal
Mathematics
1976English

On the Integers Having Exactly K Prime Factors

Annals of Mathematics
UncertaintyStatisticsProbability
1948English

Approximate Common Divisor Problem and Lattice Sieving

Математические вопросы криптографии
2018English

On an Analogue of Titchmarsh’s Divisor Problem for Holomorphic Cusp Forms

Journal of the American Mathematical Society
MathematicsApplied Mathematics
2012English

Finding Integers K for Which a Given Diophantine Equation Has No Solution in KTH Powers of Integers

Acta Arithmetica
Number TheoryAlgebra
1992English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy