-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathIntegerNumber.cs
More file actions
131 lines (118 loc) · 3.04 KB
/
IntegerNumber.cs
File metadata and controls
131 lines (118 loc) · 3.04 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace Vectores
{
class IntegerNumber
{
// Property
private int number;
// Constructor
public IntegerNumber()
{
number = 0;
}
// Methods
public void setNumber(int value)
{
number = value;
}
public int getNumber()
{
return number;
}
public bool isEven()
{
return number % 2 == 0;
}
public bool isMultiple(int multiple)
{
return number % multiple == 0;
}
public bool isSubMultiple()
{
int index = 0;
bool result = false;
for (index = 1; index < number; index++)
{
if (isMultiple(index))
{
result = true;
}
}
return result;
}
public bool isPrime()
{
bool result = false;
int r;
if (number > 1)
{
int index = 1;
do
{
index++;
r = number % index;
} while (r != 0);
result = (number == 1);
}
return result;
}
public int reverseInteger()
{
int num, digit, result;
result = 0;
num = number;
digit = num % 10;
result = (result * 10) + digit;
num = num / 10;
return result;
}
public bool isPalindrome()
{
return reverseInteger() == number;
}
public bool checkIfIsFibonacci(int a = 0, int b = 1)
{
if (number == 0 || number == 1) return true;
int c = a + b;
if (c == number) return true;
else if (c > number) return false;
return checkIfIsFibonacci(b, c);
}
public double getFactorial()
{
double result = 1;
int index;
if (number != 0)
{
for (index = Math.Abs(number); index > 1; index--)
{
result = result * index;
}
if (number < 0) result = -result;
}
return result;
}
public bool isOrder()
{
int numOrder = 0;
int[] numArray = new int[number.ToString().Length];
int digit, index, clone = number;
for (index = 0; index < number; index++)
{
digit = clone % 10;
numArray[index] = digit;
clone = clone / 10;
}
Array.Sort(numArray);
for (int i = 1; i < numArray.Length; i++)
{
numOrder = numOrder * 10 + numArray[index];
}
return number == numOrder;
}
}
}