Macquarie University, Sydney Macquarie University ResearchOnline

Showing items 1 - 6 of 6.

Add to Quick Collection   All 6 Results

  • First
  • Previous
  • 1
  • Next
  • Last
Sort:
 Add All Items to Quick Collection
Date: 2006
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/15826
Description: For a positive integer n, we let φ(n) and λ(n) denote the Euler function and the Carmichael function, respectively. We define ξ(n) as the ratio φ(n)/λ(n) and study various arithmetic properties of ξ(n ... More
Reviewed: Reviewed
Date: 2009
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/130997
Description: We give upper bounds for sums of multiplicative characters modulo an integer q ≧ 2 with the Euler function ϕ ( n ) and with the shifted largest prime divisor P ( n ) + a of integers n ≦ x .
Reviewed: Reviewed
Date: 2004
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/1159481
Description: 20 page(s)
Reviewed: Reviewed
Date: 2006
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/9972
Description: Let φ denote the Euler function. For a fixed integer k ≠ 0, we study positive integers n for which the largest prime factor of φ(n) also divides φ(n + k). We obtain an unconditional upper bound on the ... More
Reviewed: Reviewed
Date: 2006
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/16983
Description: We show that for arbitrary positive integers a₁, . . . , am, with probability 6/π² + o(1), the gcd of two linear combinations of these integers with rather small random integer coefficients coincides ... More
Reviewed: Reviewed
Date: 2006
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/43466
Description: Given an integer n, how hard is it to find the set of all integers m such that φ(m) = n, where φ is the Euler totient function? We present a certain basic algorithm which, given the prime number facto ... More
Full Text: Full Text
Reviewed: Reviewed
  • First
  • Previous
  • 1
  • Next
  • Last