An Equation Involving the Smarandache Function

2012 ◽  
Vol 204-208 ◽  
pp. 4785-4788
Author(s):  
Bin Chen
Keyword(s):  
Number Theory ◽  
Positive Integer ◽  
Elementary Number Theory ◽  
Euler Function ◽  
Elementary Number ◽  
Integer Solutions

For any Positive Integer N, LetΦ(n)andS(n)Denote the Euler Function and the Smarandache Function of the Integer N.In this Paper, we Use the Elementary Number Theory Methods to Get the Solutions of the Equation Φ(n)=S(nk) if the K=9, and Give its All Positive Integer Solutions.

scholarly journals A note on the polynomial-exponential Diophantine equation (a^n − 1)(b^n − 1) = x^2

2021 ◽  
Vol 27 (3) ◽  
pp. 123-129
Author(s):  
Yasutsugu Fujita ◽  
◽  
Maohua Le ◽  
Keyword(s):  
Number Theory ◽  
Positive Integer ◽  
Diophantine Equation ◽  
Exponential Diophantine Equation ◽  
Elementary Number Theory ◽  
Elementary Number ◽  
Integer Solutions ◽  
Positive Integers

For any positive integer t, let ord_2 t denote the order of 2 in the factorization of t. Let a,\,b be two distinct fixed positive integers with \min\{a,b\}>1. In this paper, using some elementary number theory methods, the existence of positive integer solutions (x,n) of the polynomial-exponential Diophantine equation (*) (a^n-1)(b^n-1)=x^2 with n>2 is discussed. We prove that if \{a,b\}\ne \{13,239\} and ord_2(a^2-1)\ne ord_2(b^2-1), then (*) has no solutions (x,n) with 2\mid n. Thus it can be seen that if \{a,b\}\equiv \{3,7\},\{3,15\},\{7,11\},\{7,15\} or \{11,15\} \pmod{16}, where \{a,b\} \equiv \{a_0,b_0\} \pmod{16} means either a \equiv a_0 \pmod{16} and b \equiv b_0\pmod{16} or a\equiv b_0 \pmod{16} and b\equiv a_0 \pmod{16}, then (*) has no solutions (x,n).

scholarly journals Elementary Number Theory Problems. Part II

2021 ◽  
Vol 29 (1) ◽  
pp. 63-68
Author(s):  
Artur Korniłowicz ◽  
Dariusz Surowik
Keyword(s):  
Number Theory ◽  
Positive Integer ◽  
Prime Numbers ◽  
Elementary Number Theory ◽  
Elementary Number ◽  
Composite Number

Summary In this paper problems 14, 15, 29, 30, 34, 78, 83, 97, and 116 from [6] are formalized, using the Mizar formalism [1], [2], [3]. Some properties related to the divisibility of prime numbers were proved. It has been shown that the equation of the form p 2 + 1 = q 2 + r 2, where p, q, r are prime numbers, has at least four solutions and it has been proved that at least five primes can be represented as the sum of two fourth powers of integers. We also proved that for at least one positive integer, the sum of the fourth powers of this number and its successor is a composite number. And finally, it has been shown that there are infinitely many odd numbers k greater than zero such that all numbers of the form 22 n + k (n = 1, 2, . . . ) are composite.

scholarly journals 3n+1 Problem and its Dynamics

2020 ◽  
Vol 1 ◽  
pp. 43-50
Author(s):  
Bishnu Hari Subedi ◽  
Ajaya Singh
Keyword(s):  
Number Theory ◽  
Positive Integer ◽  
Holomorphic Dynamics ◽  
Elementary Number Theory ◽  
Collatz Conjecture ◽  
Elementary Number ◽  
The Subject ◽  
Basic Facts

The subject of this paper is the well-known 3n + 1 problem of elementary number theory. This problem concerns with the behaviour of the iteration of a function which takes odd integers n to 3n + 1, and even integers n to n/2. There is a famous Collatz conjecture associated to this problem which asserts that, starting from any positive integer n, repeated iteration of the function eventually produces the value. We briefly discuss some basic facts and results of 3n + 1 problem and Collatz conjecture. Basically, we more concentrate on the generalization of this problem and conjecture to holomorphic dynamics.

SOLUTIONS TO A LEBESGUE–NAGELL EQUATION

2021 ◽  
pp. 1-12
Author(s):  
NGUYEN XUAN THO
Keyword(s):  
Number Theory ◽  
Computer Search ◽  
Elementary Number Theory ◽  
Lucas Sequences ◽  
Elementary Number ◽  
Primitive Divisors ◽  
Integer Solutions

Abstract We find all integer solutions to the equation $x^2+5^a\cdot 13^b\cdot 17^c=y^n$ with $a,\,b,\,c\geq 0$ , $n\geq 3$ , $x,\,y>0$ and $\gcd (x,\,y)=1$ . Our proof uses a deep result about primitive divisors of Lucas sequences in combination with elementary number theory and computer search.

Elementary Number Theory

2016 ◽  
pp. 1-32
Author(s):  
Gary L. Mullen ◽  
James A. Sellers
Keyword(s):  
Number Theory ◽  
Elementary Number Theory ◽  
Elementary Number

Some Elementary Number Theory

2019 ◽  
pp. 239-244
Author(s):  
Richard Evan Schwartz
Keyword(s):  
Number Theory ◽  
Elementary Number Theory ◽  
Result Section ◽  
Structural Result ◽  
Elementary Number

This chapter proves some number-theoretic results about the sequences defined in Chapter 23. It proceeds as follows. Section 24.2 proves Lemma 24.1, a multipart structural result. Section 24.3 takes care of several number-theoretic details left over from Section 23.6 and Section 23.7.

Sign in / Sign up

Export Citation Format

Share Document