We determine the distribution over square-free integers $n$ of the pair $({dim}_{{𝔽}_2}{\mathrm{Sel}}^{\Phi }(E_n/\mathbb{Q}),{dim}_{{𝔽}_2}{\mathrm{Sel}}^{\widehat{\Phi }}(E_n^{\text{'}}/\mathbb{Q}))$, where $E_n$ is a curve in the congruent number curve family, $E_n^{\text{'}}:y^2=x^3+4n^{2}x$ is the image of isogeny $\Phi :E_n\to E_n^{\text{'}}$, $\Phi (x,y)=(y^2/x^2,y(n^2-x^2)/x^2)$, and $\widehat{\Phi }$ is the isogeny dual to $\Phi$.

Let ${𝔖}_n$ denote the symmetric group with $n$ letters, and $g\left(n\right)$ the maximal order of an element of ${𝔖}_n$. If the standard factorization of $M$ into primes is $M=q_1^{{\alpha }_1}{q}_2^{{\alpha }_2}...q_k^{{\alpha }_k}$, we define $\ell \left(M\right)$ to be $q_1^{{\alpha }_1}+q_2^{{\alpha }_2}+...+q_k^{{\alpha }_k}$; one century ago, E. Landau proved that $g\left(n\right)={max}_{\ell \left(M\right)\le n}M$ and that, when $n$ goes to infinity, $logg\left(n\right)\sim \sqrt{nlog\left(n\right)}$.There exists a basic algorithm to compute $g\left(n\right)$ for $1\le n\le N$; its running time is $𝒪\left(N^{3/2}/\sqrt{logN}\right)$ and the needed memory is $𝒪\left(N\right)$; it allows computing $g\left(n\right)$ up to, say, one million. We describe an algorithm to calculate $g\left(n\right)$ for $n$ up to ${10}^{15}$. The main idea is to use the so-called $\ell$-superchampion...

Let $G:=\mathrm{SO}{(n,1)}^{\circ }$ and $\Gamma (n-1)/2$ for $n=2,3$ and when $\delta >n-2$ for $n\ge 4$, we obtain an effective archimedean counting result for a discrete orbit of $\Gamma$ in a homogeneous space $H\setminus G$ where $H$ is the trivial group, a symmetric subgroup or a horospherical subgroup. More precisely, we show that for any effectively well-rounded family $\{{ℬ}_T\subset H\setminus G\}$ of compact subsets, there exists $\eta >0$ such that $\#\left[e\right]\Gamma \cap {ℬ}_T=ℳ\left({ℬ}_T\right)+O\left(ℳ{\left({ℬ}_T\right)}^{1-\eta }\right)$ for an explicit measure $ℳ$ on $H\setminus G$ which depends on $\Gamma$. We also apply the affine sieve and describe the distribution of almost primes on orbits of $\Gamma$ in arithmetic settings....