import sys



	def func(n, m):
    s = 0
    if n < m:
        s = s + n
    else:
        i = 1
        while 1:
            if m ** i <= n < m ** (i + 1):
                s = s + 1
                break
            i += 1
        n = n - m ** i
        if n:
            s0 = func(n, m)
            s = s + s0
    return s



	def ***(n,m):
    t = n % m
    while t:
        n = m
        m = t
        t = n % m
    return m



	if __name__ == '__main__':
    n = int(sys.stdin.readline().strip())
    s_all = 0
    for i in range(2, n):
        s = func(n, i)
        s_all = s_all + s
    length = len(range(2, n))
    *** = ***(s_all, length)
    a,b = int(s_all/***), int(length/***)
    print('{0}/{1}'.format(a, b))

def f(n, m): # 求最大公约数
    while m > 0:
        t = n % m
        n = m
        m = t
    return n

if __name__ == '__main__':
    while 1:
        try:
            A=int(input())
        except:
            break
        X = 0 # 不同进制位数和
        for i in range(2,A): # 换算成2至n-1进制
            temp = A
            while temp!=0: #当商不为0时，辗转相除
                X += temp % i # 将余数累加
                temp = temp // i #商
        Y=A-2 #不同的进制数
        m = f(X, Y) # 求X和Y的最大公约数
        X , Y = X//m, Y//m # 结果除以最大公约数
        print('%d/%d'%(X,Y))

python解法：

在化简的时候先求分子和分母的最大公约数，再将这两个数同时除以最大公约数即可。

from math import gcd

def calcSumOfANumber(number):
    total = 0
    for i in range(2, number):
        res, num = 0, number
        while num:
            res += num % i
            num = num // i
        total += res
    return total

while True:
    try:
        a = int(input())
        b = calcSumOfANumber(a)
        gcdRes = gcd(b, a - 2)
        print(str(b // gcdRes) + "/" + str((a - 2) // gcdRes))
    except:
        break

        break

from fractions import Fraction
import math
num = int(input())
result = 0
for x in range(2, num):
    a = num
    while (a != 0):
        a, b = divmod(a, x)
        result += b
if math.modf(result / (num - 2))[0] == 0:
    print(str(result // (num - 2)) + "/1")
else:
    print(Fraction(result, num - 2))

def SysConvert(N,x):
    remainder = []
    while(N >= x):
        remainder.append(N%x)
        N =int( N/x)
    remainder.append(N%x)
    return sum(remainder)
def GetAllSum(N):
    sum = 0
    n = 0
    for i in range(2,N):
        sum += SysConvert(N, i)
        n += 1
    return sum,n
def gcd(x, y):
    while y != 0:
        (x, y) = (y, x % y)
    return x
def PrintOut(N):
    sums,lens = GetAllSum(N)
    gcds = gcd(sums,lens)
    result = '/'.join([str(int(sums/gcds)),str(int(lens/gcds))])
    return result
import sys

N = int(input())
print(PrintOut(N))

#coding=utf-8
import sys
def zero(a):
    for i in a:
        if i==0:
            continue
        else:
            return False
    return True
def o2n(a,old,new):
    r=[]#存储商
    b=[]#存储新进制数
    while not zero(a):
        t=0
        for i in a:
            t=t*old+i
            r.append(t//new)#除新进制数new得到商
            t%=new#取余数
        b.append(t)#存储余数
        a=[i for i in r]#把商传给a数组
        r=[]#清空r数组
    b.reverse()
    return b
def div(a,b):
	for i in range(min(a,b),1,-1):
		if a%i==0 and b%i==0:
			a/=i
			b/=i
			break
	return a,b
	
a=input()
s=map(int,str(a))
sm=0
for i in range(2,a):
	sm+=sum(o2n(s,10,i))
x,y=div(sm,a-2)
print '%d/%d'%(x,y)