# Prove that there are infinitely many pairs of integers m and n such that σ(m2 ) = σ(n 2 ).?

• Prove that there are infinitely many pairs of integers m and n such that σ(m2 ) = σ(n 2 ).?

Answer to Prove that there are infinitely many pairs of integers ... prove that there are infinitely many pairs ... many pairs of integers a and b such ...
Positive: 43 %
There are infinitely many Perrin pseudoprimes. ... there are infinitely many Carmichael numbers N such that φ(N)=a 2+nb 2 for some positive integers a and b.
Positive: 40 %

### More resources

... 2^n\$ is not prime, but I didn't succeed in proving the conjecture. My conjecture is the following: ... Is \$3^n - 2^n\$ composite for all integers \$n ...
Positive: 43 %
d d ( n d ) . 24. ... 00. 25. Prove from MATH 122 at Mary Washington. Study Resources . By School; By Subject; By Standardized Tests; By Book; Tutors .
Positive: 38 %
Support Bases of Solutions of a Functional Equation Arising From Multiplication of ... integers if P contains infinitely many pairs ... there is a strong ...