public List<Fraction> getAllFraction(int m, int n){
		LinkedList<Fraction> list=new LinkedList<Fraction>();
		if(m>n || m<=0) return list;
		
		for(int p=m;p<=n;p++){
			LinkedList<Fraction> tmpList=new LinkedList<Fraction>();
			for(int q=1;q<p;q++){
				if(getGCD(p,q)==1){
					tmpList.add(new Fraction(p,q));
				}
			}
			list=mergeList(list,tmpList);
		}
		
		return list;
	}