Proofs regarding Fermat numbers
Not what you're looking for? Search our solutions OR ask your own Custom question.
The Fermat numbers are numbers of the form 2 ^2n + 1 = Φn . Prove that if n < m , then Φn │ϕ m - 2.
The Fermat numbers are numbers of the form 2 ^2n + 1 = (Phi)n . Prove that if n < m , then (Phi)n │(Phi)m - 2.
© BrainMass Inc. brainmass.com November 30, 2021, 12:09 am ad1c9bdddfhttps://brainmass.com/math/linear-algebra/proofs-regarding-fermat-numbers-23515
Solution Summary
This solution is comprised of a detailed explanation for solving the problems on Fermat numbers.
It contains step-by-step explanation for proving statement that if n < m , then Φn │Φm - 2,
where Φn is the Fermat numbers such that Φn = 2 ^2n + 1.
It contains step-by-step explanation for proving statement that if n < m , then (Phi)n │(Phi)m - 2,
where (Phi)n is the Fermat numbers such that (Phi)n = 2 ^2n + 1.
Solution contains detailed step-by-step explanation.
$2.49