The tag has no wiki summary.

learn more… | top users | synonyms

8
votes
1answer
488 views

How to check whether a positive integer can be written as linear combination of given others, where all coefficients are positive?

Let $n$, $k$ and $m_1, \dots, m_k$ be positive integers. Which is the most efficient algorithm to find out whether there are positive integers $a_1, \dots, a_k$ such that $n = \sum_{i=1}^k a_i m_i$? ...
3
votes
0answers
153 views

Comparing different Euclidean algorithms on a Euclidean domain

I have posted this question at stackexchange (502413), without responses until now. In the papers by T. Motzkin: The Euclidean Algorithm, Bull. AMS 55, 1949, pp. 1142--1146 and P. Samuel: About ...
7
votes
1answer
941 views

Reference request: number theory of Z[1/p]

Can anyone suggest a good place to read up on the number theoretic properties of and techniques for $\mathbb{Z}[1/p]$, (that is, rational numbers with only powers of a prime $p$ in the denominator)? ...
17
votes
3answers
1k views

Must a ring which admits a Euclidean quadratic form be Euclidean?

The question is in the title, but employs some private terminology, so I had better explain. Let $R$ be an integral domain with fraction field $K$, and write $R^{\bullet}$ for $R \setminus \{0\}$. ...
30
votes
3answers
2k views

Why do we care whether a PID admits some crazy Euclidean norm?

An integral domain $R$ is said to be Euclidean if it admits some Euclidean norm: i.e., a function $N: R \rightarrow \mathbb{N} = \mathbb{Z}^{\geq 0}$ such that: for all $x, y \in R$ with $N(y) > ...