Enumerating integers n s.t. 36 | 48n

  • #1
1,462
44
This is a simple computational question. Let ##n \in [0, 36)##. What's the fastest way to list all ##n## s.t ##36## divides ##48n##?
 

Answers and Replies

  • #2
13,580
7,568
Well first I would get a list of numbers for n where it is true and from there deduce the fastest algorithm to list them.

Alternatively, you can look at what n should be such that 48*n contains the factors of 36 namely 2*2*3*3.

so what must n provide so that the product contains the factors of 36?
 
  • #3
36,035
7,968
Let n∈[0,36)
This notation is a bit odd, as it implies that n belongs to the real interval. A better way to write it IMO would be
##\text{Let } n \in \{0, 1, 2, \dots, 35\}##

Alternatively, you can look at what n should be such that 48*n contains the factors of 36 namely 2*2*3*3.
I would probably do this first, rather than as an alternate approach.
 

Related Threads on Enumerating integers n s.t. 36 | 48n

Replies
9
Views
2K
Replies
4
Views
2K
Replies
17
Views
11K
Replies
8
Views
20K
Replies
6
Views
347
  • Last Post
Replies
9
Views
2K
  • Last Post
Replies
1
Views
3K
  • Last Post
Replies
1
Views
2K
  • Last Post
Replies
20
Views
3K
  • Last Post
Replies
11
Views
5K
Top