We will start by describing the density of SLn(Z[1/p]) in SLn(R) in a quantitative manner along the line of work by Ghosh--Gorodnik--Nevo. The Diophantine exponent κ for a pair of elements x,y∈SLn(R) is a certain positive real number that, loosely, measures the complexity of an element γ∈SLn(Z[1/p]) such that γx approximates y with a prescribed error. Ghosh--Gorodnik--Nevo conjectured that κ should be optimal, which means κ≤1 (after certain normalization), and proved this on certain varieties. However, for SL(n) their method gives κ≤n−1. In this talk, we try to describe how certain automorphic techniques can improve the bound of κ to something as good as 1+O(1/n). If time permits, we will also talk about the L2-growth of the Eisenstein series on reductive groups. This is one of the inputs in our proof towards improved Diophantine exponent. This is a joint work with Amitay Kamber.