We obtain a numerical result that the Radau rules are better in accuracy than the Gauss–Legendre (GL) formula for the integral of even functions on the interval \([-1,1]\) . There exist two types of the Radau rules having a node at either 1 or \(-1\) , as well as interior nodes. The two Radau rules are the same for even functions, so the numerical result suggests that their averaged rule (a-R) is superior to the GL rule, regardless of odd or even. We investigate this phenomenon for the integral with the Jacobi weight function \((1-x)^\alpha (1+x)^\beta \) ( \(\alpha >-1\) , \(\beta >-1\) ). The a-R with the ratio \((n+\alpha ):(n+\beta )\) of the n-point Radau rules with degree of exactness \(2n-2\) is of degree \(2n-1\) . The degree rises to 2n when \(\alpha +\beta =-1\) , and to \(4n-3\) when \(\alpha =\beta =-\tfrac{1}{2}\) . This indicates that the two Radau rules have errors of opposite sign, so each rule is the anti-rule to the other one. When \(\alpha =\beta =0\) (the Legendre weight), the a-R has the same degree of exactness as that of the n-point GL rule, the dominant error term of the a-R being smaller in magnitude than that of the GL rule. The propositions above are also numerically verified. Further numerical results show that the a-R can be effectively used to estimate the errors of the Radau rules.