mersenneforum.org  

Go Back   mersenneforum.org > Math Stuff > Computer Science & Computational Number Theory

Reply
 
Thread Tools
Old 2019-08-23, 20:49   #1
bhelmes
 
bhelmes's Avatar
 
Mar 2016

397 Posts
Default euler phi function and quadratic irred. polynomials

A peaceful night for everyone,


Is it possible to calculate the euler phi function for the function terms of a quadratic irreducible polynomial like f(n)=n²+1 (n element of N) ?


Or is there a hidden pattern ?


Greetings from the tan (2 alpha)
https://en.wikipedia.org/wiki/List_o...angle_formulae


Bernhard
bhelmes is offline   Reply With Quote
Old 2019-08-24, 08:26   #2
Nick
 
Nick's Avatar
 
Dec 2012
The Netherlands

175910 Posts
Default

Calculating ϕ(n) is hard in the same sense that factorizing n is hard.
There may be patterns for some specific polynomials but I don't think you will find one in general.
Nick is offline   Reply With Quote
Old 2019-08-24, 15:00   #3
Dr Sardonicus
 
Dr Sardonicus's Avatar
 
Feb 2017
Nowhere

577710 Posts
Default

Here's a pattern:

If n is odd, then ϕ(n2 + 1) = ϕ((n2 + 1)/2)

If n is even, then ϕ(n2 + 1) is divisible by 4.
Dr Sardonicus is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
primesieves for quadratic polynomials bhelmes Math 21 2020-03-19 22:14
the multiplicativ structur of the discriminant for quadratic polynomials bhelmes Computer Science & Computational Number Theory 3 2017-05-27 01:33
Basic Number Theory 7: idempotents and Euler's function Nick Number Theory Discussion Group 17 2016-12-01 14:27
euler's totient function toilet Math 1 2007-04-29 13:49
application of euler's phi function TalX Math 3 2007-04-27 11:50

All times are UTC. The time now is 09:03.


Mon May 23 09:03:34 UTC 2022 up 39 days, 7:04, 0 users, load averages: 1.04, 1.31, 1.36

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2022, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.

≠ ± ∓ ÷ × · − √ ‰ ⊗ ⊕ ⊖ ⊘ ⊙ ≤ ≥ ≦ ≧ ≨ ≩ ≺ ≻ ≼ ≽ ⊏ ⊐ ⊑ ⊒ ² ³ °
∠ ∟ ° ≅ ~ ‖ ⟂ ⫛
≡ ≜ ≈ ∝ ∞ ≪ ≫ ⌊⌋ ⌈⌉ ∘ ∏ ∐ ∑ ∧ ∨ ∩ ∪ ⨀ ⊕ ⊗ 𝖕 𝖖 𝖗 ⊲ ⊳
∅ ∖ ∁ ↦ ↣ ∩ ∪ ⊆ ⊂ ⊄ ⊊ ⊇ ⊃ ⊅ ⊋ ⊖ ∈ ∉ ∋ ∌ ℕ ℤ ℚ ℝ ℂ ℵ ℶ ℷ ℸ 𝓟
¬ ∨ ∧ ⊕ → ← ⇒ ⇐ ⇔ ∀ ∃ ∄ ∴ ∵ ⊤ ⊥ ⊢ ⊨ ⫤ ⊣ … ⋯ ⋮ ⋰ ⋱
∫ ∬ ∭ ∮ ∯ ∰ ∇ ∆ δ ∂ ℱ ℒ ℓ
𝛢𝛼 𝛣𝛽 𝛤𝛾 𝛥𝛿 𝛦𝜀𝜖 𝛧𝜁 𝛨𝜂 𝛩𝜃𝜗 𝛪𝜄 𝛫𝜅 𝛬𝜆 𝛭𝜇 𝛮𝜈 𝛯𝜉 𝛰𝜊 𝛱𝜋 𝛲𝜌 𝛴𝜎𝜍 𝛵𝜏 𝛶𝜐 𝛷𝜙𝜑 𝛸𝜒 𝛹𝜓 𝛺𝜔