people knew it was you?
Answer
I don't know tbh, Maybe once or twice here or there.
Explanation:
A. draw the chart using the DTP program draw option
B.
create the chart in a spreadsheet then import it
C.
use the DTP chart wizard to create the chart within the DTP
D.
create an image of the chart in an image editor then import the image
E.use HTML code to create a chart within the DTP program
Answer:
B. create the chart in a spreadsheet then import it
Explanation:
For any DTP (Data Transfer Project) programme, it is possible to upload all the necessary document for easy access any time of need.
A chart can best be created using a spreadsheet or ant other chart creator software, then it can be uploaded to DTP project.
Answer:
B.) create the chart in a spreadsheet then import it.
Explanation:
This is the answer on plato. ( At least I think so, sorry if I am wrong :P )
Answer:
import math
# Python program for presenting all the prime numbers till an agreed numeral
prime=[]
def findprimeinanarray(n):
print("Prime numbers admid", 1, "and", n, "are:")
j=0
flag=0
for n in range(1, n + 1):
# all prime numbers are greater than
if n > 1:
for i in range(2, n):
if (n % i) == 0:
flag=0
break
else:
flag=1
if flag==1:
prime.insert(j,n)
j=j+1
else:
continue
print(prime[:])
# A Python function for printing all the prime functions and a Python program to print prime factor
prime1=[]
j=0
# A function to print all the prime factors of a given number if it is not prime
def primeFact(num):
while num % 2==0:
prime1.insert(2,0)
num = num/2
# num should be odd at this breakpoint
# so we need a shift of 2 ( i = i + 2)
for i in range(3,int(math.sqrt(num))+1,2):
# while i divides num , print i ad divide num
while num % i== 0:
num = num /i
if num >2:
j=j+1
prime1.insert(num,j)
print(prime1[:])
# program to test the coderint
n=600
findprimeinanarray(7)
k = 45
primeFact(k)
Explanation:
import math
# Python program for presenting all the prime numbers till an agreed numeral
prime=[]
def findprimeinanarray(n):
print("Prime numbers admid", 1, "and", n, "are:")
j=0
flag=0
for n in range(1, n + 1):
# all prime numbers are greater than
if n > 1:
for i in range(2, n):
if (n % i) == 0:
flag=0
break
else:
flag=1
if flag==1:
prime.insert(j,n)
j=j+1
else:
continue
print(prime[:])
# A Python function for printing all the prime functions and a Python program to print prime factor
prime1=[]
j=0
# A function to print all the prime factors of a given number if it is not prime
def primeFact(num):
while num % 2==0:
prime1.insert(2,0)
num = num/2
# num should be odd at this breakpoint
# so we need a shift of 2 ( i = i + 2)
for i in range(3,int(math.sqrt(num))+1,2):
# while i divides num , print i ad divide num
while num % i== 0:
num = num /i
if num >2:
j=j+1
prime1.insert(num,j)
Answer: An old cartoon from the 1930's! :)
Answer:
a
Explanation:
it depends on what kind of electronic it is for
Answer:
Plug it is in the right slots add as brainlyest please
Explanation: