Several number theoretic functions are prepared in UBASIC as embedded functions from the start.

But in case of usual computer languages, we have to implement those functions by ourselves.

In this chapter, I explain computing methods for number theoretic functions and algorithms used for number theoretic computation.

- Euclidean algorithm for GCD
- Power
- Moebius function, Euler function
- Fibonacci and Lucas number, definition of Lucas sequence
- Computation of Lucas sequence
- Bernoulli and Euler number
- Cyclotomic polynomial and cyclotomic number
- Wieferich prime (April 01, 2009)
- a
^{n}=c mod n (July 22, 2009) - Hilbert and Weber class polynomial

Chapter 10 Congruent Numbers (Congruum) |
"Mathematician's Secret Room" | Chapter 12 Integer Factorization Algorithms |
---|---|---|

Chapter 10 (Japanese) | index (Japanese) | Chapter 12 (Japanese) |

E-mail : kc2h-msm@asahi-net.or.jpHisanori Mishima