Up for the Count !

for Writers of Mathematics		phi ( sigma ( n ) ) = sigma ( phi ( n ) )
for Writers on Mathematics and Science		Abundancy : Some Resources
Geometry		Primitive Friendly Integers and Exclusive Multiples
Number Theory		Counting Faces on n-dimensional Hypercubes
Higher Arithmetic		Huge Factors of Enormous Integers
for Casual Visitors		Exponential Prime Power Representation

           

For Writers of Mathematics

Counting in Separate Realms

Perfect Numbers Concise

Exponential Prime Power Representation

For Writers on Mathematics and Science

Perfect Numbers Concise

The Fermat-Wiles Theorem

Why is .999... = 1 ?

Geometry

Huge Factors of Enormous Integers

Counting Faces on n-dimensional Hypercubes

phi ( sigma ( n ) ) = sigma ( phi ( n ) )

Doric Columns of Primes

Number Theory

Abundancy : Some Resources
A little about abundancy

A billion solutions to
phi ( sigma ( n ) ) = sigma ( phi ( n ) )
and a conjecture
Sophie Germain primes

Huge Factors of Enormous Integers

Primitive Friendly Integers and Exclusive Multiples
Small Primitive Friendly Pairs
Primitive Friendly Pairs from a Formula

Exponential Prime Power Representation

Near-multiperfects

Augmentation of Table of Abundancies

Counting in Separate Realms

The Fermat-Wiles Theorem

Perfect Numbers Concise

Why is .999... = 1 ?

Really Fast Primality Test

Doric Columns of Primes

Errata

Casual Visitors - Welcome !

You can view the first couple of these as you would a circus -- even if you have no intention of trying them at home .

Huge Factors of Enormous Integers

Doric Columns of Primes

Counting Faces on n-dimensional Hypercubes

The Fermat-Wiles Theorem