integer {p,k} = pk, res = phi(power(p,k))
sequence r = apply(n,{ident,phi,reduced_totient,k_iter}[i])
...
17 KB (1,749 words) - 17:00, 2 May 2024
println(" $(sturmian_word(cfck(5, 1, -1, 2, 8)...)) <== 1/phi (8th convergent golden ratio)")
01001010010010100101001001010010 <== 1/phi (8th convergent golden ratio)
...
17 KB (2,274 words) - 07:36, 18 April 2024
:<math>\phi = 1 + {1\over{1+{1\over{1+{1\over{1 + \cdots}}}}}}</math>
...he resulting quadratic equation for its positive solution, one gets <math>\phi = (1 + \sqrt{5})/2 \approx 1.61803398875</math>.
...
59 KB (7,116 words) - 13:56, 8 March 2024
phi = (1 + sqrt(5)) / 2
V r = 2 * (i ^ phi) / seeds
...
40 KB (4,920 words) - 04:31, 24 March 2024
System.print("phi = %(cfcQuad.call(5, 1, 1, 2, 8))")</syntaxhighlight>
phi = [1/1, 2/1, 3/2, 5/3, 8/5, 13/8, 21/13, 34/21]
...
10 KB (1,195 words) - 11:28, 13 February 2024
::* Euler's phi totient function
::* phi totient function
...
147 KB (16,575 words) - 15:09, 14 February 2024
phi = 0
if GCD(m, n) = 1 then phi += 1
...
79 KB (8,983 words) - 18:38, 2 March 2024
phi, ihp := big.NewFloat(0.5).SetPrec(pr), big.NewFloat(0.5).SetPrec(pr)
phi.Add(root, phi)
...
109 KB (13,594 words) - 12:12, 4 December 2023
where 𝚽() is Phi; the Euler totient function.
# a(n) = n(n-1)/2 + 1 - sum i = 1..n of phi(i) where phi is Euler's #
...
51 KB (5,084 words) - 22:43, 11 March 2024
...<span style="color: #004080;">atom</span> <span style="color: #000000;">phi</span>
<span style="color: #000000;">phi</span> <span style="color: #0000FF;">=</span> <span style="color: #0000FF;"
...
86 KB (10,781 words) - 21:52, 13 April 2024
...ree" when 'x' is zero, and even before that since the real meaning of the "phi"/φ function is to produce a count of all of the values greater than zero (i
...uld make it obvious that there is no need to "split"/recursively call for "phi" nodes where the first argument is zero, and someone with a mathematics int
...
211 KB (29,935 words) - 08:01, 3 March 2024
phi := 54
theta := abs(180-144-phi)
...
82 KB (10,049 words) - 11:40, 24 January 2024
V phi = p - 1
I (pow(BigInt(n), phi I/ 2, p) != 1)
...
97 KB (12,435 words) - 09:36, 20 November 2023
<li> phi p = 0.6 </li>
<li> phi g = 0.3 </li>
...
121 KB (14,364 words) - 10:50, 24 January 2024
|phi || f or ph
phi f or ph
...
52 KB (6,072 words) - 09:53, 1 March 2024
LLI phi n = (p-1) * (q-1);
LLI d = modular inverse (e, phi n);
...
103 KB (11,538 words) - 19:53, 3 February 2024
Now the order of ''a'' with regard to ''p^k'' must divide ''Φ(p^k)''. Call this number ''t'', and determine it's factors ''q^e''. Since
LONG INT t := (p-1)*(p**SHORTEN (e-1)); # = Phi(p**e) where p prime #
...
106 KB (13,525 words) - 11:28, 18 May 2024
double phi = (ii + 0.5) * theta;
double c1 = Math.Cos(phi);
...
93 KB (10,535 words) - 09:41, 7 March 2024
<syntaxhighlight lang="ocaml">let rec fN n g phi =
if phi < 31 then
...
88 KB (9,798 words) - 12:51, 24 April 2024
phi=: -:>:%:5
{{ <.0.5+(phi^y)%%:5 }} b 15
...
66 KB (7,334 words) - 00:59, 20 April 2024
