English Deutsch Français Italiano Español Português 繁體中文 Bahasa Indonesia Tiếng Việt ภาษาไทย
All categories

2006-12-18 07:09:10 · 6 answers · asked by nornor 1 in Science & Mathematics Mathematics

6 answers

1.
Always.

2006-12-18 07:15:18 · answer #1 · answered by DiphallusTyranus 3 · 0 0

1

2016-10-22 00:45:34 · answer #2 · answered by Deepa 1 · 0 0

1. Use Euclid's algorithm to divide n+1 by n. Goes in 1 time, remainder 1. Then divide n by 1, goes in n times, remainder 0. When you get remainder 0, the last divisor is the greatest common factor. Here, it is 1.

2006-12-18 07:14:39 · answer #3 · answered by Philo 7 · 1 0

always 1

2006-12-18 07:16:34 · answer #4 · answered by PaD 2 · 0 0

Wouldn't it be 1?

2006-12-18 07:15:25 · answer #5 · answered by yungr01 3 · 0 0

muliply the 2 numbers

2006-12-18 07:15:23 · answer #6 · answered by Renaud 3 · 0 2

fedest.com, questions and answers